Consensus algorithms for the generation of all maximal bicliques
Authors:
- Gabriela AlexeGAGabriela Alexe
- Sorin AlexeSASorin Alexe
- Yves CramaYCYves Crama
- Stephan FoldesSFStephan Foldes
- Peter L. HammerPHPeter L. Hammer
- Bruno SimeoneBSBruno Simeone
- 1 December 2004
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 145 (1) , 11-21
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- The maximum edge biclique problem is NP-completeDiscrete Applied Mathematics, 2003
- On Bipartite and Multipartite Clique ProblemsJournal of Algorithms, 2001
- Approximating Clique and Biclique ProblemsJournal of Algorithms, 1998
- Arboricity and bipartite subgraph listing algorithmsInformation Processing Letters, 1994
- Recognition of Quadratic Graphs and Adjoints of Bidirected GraphsAnnals of the New York Academy of Sciences, 1989
- Stability in circular arc graphsJournal of Algorithms, 1988
- On generating all maximal independent setsInformation Processing Letters, 1988
- The NP-completeness column: An ongoing guideJournal of Algorithms, 1987
- Maximum matching in a convex bipartite graphNaval Research Logistics Quarterly, 1967
- Coverings of Bipartite GraphsCanadian Journal of Mathematics, 1958