Generating bicliques of a graph in lexicographic order
Authors:
- Vânia M.F. DiasVDVânia M.F. Dias
- Celina M.H. de FigueiredoCFCelina M.H. de Figueiredo
- Jayme L. SzwarcfiterJSJayme L. Szwarcfiter
- 1 June 2005
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 337 (1-3) , 240-248
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Consensus algorithms for the generation of all maximal bicliquesDiscrete Applied Mathematics, 2004
- The maximum edge biclique problem is NP-completeDiscrete Applied Mathematics, 2003
- On Bipartite and Multipartite Clique ProblemsJournal of Algorithms, 2001
- Bicliques in Graphs I: Bounds on Their NumberCombinatorica, 2000
- Approximating Clique and Biclique ProblemsJournal of Algorithms, 1998
- Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphsDiscrete Applied Mathematics, 1998
- On edge perfectness and classes of bipartite graphsDiscrete Mathematics, 1996
- Absolute reflexive retracts and absolute bipartite retractsDiscrete Applied Mathematics, 1993
- On generating all maximal independent setsInformation Processing Letters, 1988
- Perfect Elimination and Chordal Bipartite GraphsJournal of Graph Theory, 1978