๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Efficient algorithms for mining maximal valid groups

โœ Scribed by Yida Wang; Ee-Peng Lim; San-Yih Hwang

Publisher
Springer-Verlag
Year
2006
Tongue
English
Weight
661 KB
Volume
17
Category
Article
ISSN
1066-8888

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Efficient Sequential and Parallel Algori
Efficient Sequential and Parallel Algorithms for Maximal Bipartite Sets
โœ D. Pearson; V.V. Vazirani ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 344 KB

A maximal bipartite set (MBS) in an undirected graph \(G=(V, E)\) is a maximal collection of vertices \(B \subseteq V\) whose induced subgraph is bipartite. In this paper we present efficient sequential (linear time) and parallel (NC) algorithms for constructing an MBS. 1.1993 Acatemic Press, Inc