Generating bicliques of a graph in lexicographic order

Theoretical Computer Science

Volumn 337, Issue 1-3, 2005, Pages 240-248

  Dias, Vânia M F ^a   De Figueiredo, Celina M H ^a   Szwarcfiter, Jayme L ^a  

^a FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

Algorithms; Biclique; Enumeration; Lexicographic order; NP complete; Polynomial time delay

Indexed keywords

ALGORITHMS; COMPUTER SCIENCE; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

BICLIQUE; ENUMERATION; LEXICOGRAPHIC ORDER; NP-COMPLETE; POLYNOMIAL-TIME DELAY;

GRAPH THEORY;

EID: 18444390272     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.01.014     Document Type: Article

References (19)

1. G. Alexe, S. Alexe, Y. Crama, S. Foldes, P. Hammer, B. Simeone, Consensus algorithms for the generation of all maximal bicliques, Discrete Appl. Math. 145 (1) (2004) 11-21.
2. J. Amilhastre, M.C. Vilarem, and P. Janssen Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs Discrete Appl. Math. 86 2-3 1998 125 144
3. H.-J. Bandelt, M. Farber, and P. Hell Absolute reflexive retracts and absolute bipartite retracts Discrete Appl. Math. 44 1-3 1993 9 20
4. M. Dawande, P. Keskinocak, J.M. Swaminathan, and S. Tayur On bipartite and multipartite clique problems J. Algorithms 41 2 2001 388 403
5. M. Garey, and D. Johnson Computers and Intractability, a Guide to the Theory of NP-Completeness 1979 W.H. Freeman and Company New York
6. M.C. Golumbic, and C.F. Goss Perfect elimination and chordal bipartite graphs J. Graph Theory 2 2 1978 155 163
7. D.S. Hochbaum Approximating clique and biclique problems J. Algorithms 29 1 1998 174 200
8. D.S. Johnson, M. Yannakakis, and C.H. Papadimitriou On generating all maximal independent sets Inform. Process. Lett. 27 3 1988 119 123
9. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins Trawling the web for emerging cyber communities Proc. Eighth Internat. Conf. on World Wide Web 1999 Elsevier North-Holland 1481 1493
10. E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan Generating all maximal independent sets NP-hardness and polynomial-time algorithms SIAM J. Comput. 9 3 1980 558 565
11. H. Müller On edge perfectness and classes of bipartite graphs Discrete Math. 149 1-3 1996 159 187
12. J. Orlin Containment in graph theory covering graphs with cliques Nederl. Akad. Wetensch. Indag. Math. 39 1997 211 218
13. M.C. Paull, and S.H. Unger Minimizing the number of states in incompletely specified sequential switching functions IRE Trans. Electron. Comput. EC-8 1959 356 367
14. R. Peeters The maximum edge biclique problem is NP-complete Discrete Appl. Math. 131 3 2003 651 654
15. E. Prisner Bicliques in graphs. II. Recognizing k -path graphs and underlying graphs of line digraphs Graph-theoretic Concepts in Computer Science (Berlin, 1997), Lecture Notes in Computer Science Vol. 1335 1997 Springer Berlin 273 287
16. E. Prisner Bicliques in graphs. I. Bounds on their number Combinatorica 20 1 2000 109 117
17. S. Tsukiyama, M. Ide, H. Ariyoshi, and I. Shirakawa A new algorithm for generating all the maximal independent sets SIAM J. Comput. 6 3 1977 505 517
18. Z. Tuza Covering of graphs by complete bipartite subgraphs complexity of 0-1 matrices Combinatorica 4 1 1984 111 116
19. M. Yannakakis Node- and edge-deletion NP-complete problems Conf. Record of the Tenth Ann. ACM Symp. on Theory of Computing (San Diego, California, 1978) 1978 ACM New York 253 264