On the generation of bicliques of a graph

Discrete Applied Mathematics

Volumn 155, Issue 14, 2007, Pages 1826-1832

  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; Convex bipartite graphs; Enumeration; NP complete; Polynomial time delay

Indexed keywords

ALGORITHMS; POLYNOMIALS; SET THEORY; TIME DELAY;

BICLIQUE; CONVEX BIPARTITE GRAPHS; ENUMERATION; NP-COMPLETE; POLYNOMIAL TIME DELAY;

GRAPH THEORY;

EID: 34547684280     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2007.03.017     Document Type: Article

References (16)

1. Alexe G., Alexe S., Crama Y., Foldes S., Hammer P.L., and Simeone B. Consensus algorithms for the generation of all maximal bicliques. Discrete Appl. Math. 143 (2004) 11-21
2. Amilhastre J., Vilarem M.C., and Janssen P. Complexity of minimum biclique cover and minimum biclique decomposition for bipartite dominofree graphs. Discrete Appl. Math. 86 (1998) 125-144
3. Bandelt H.J., Faber M., and Hell P. Absolute reflexive retracts and absolute bipartites retracts. Discrete Appl. Math. 44 (1993) 9-20
4. Booth K.S., and Lueker G.S. Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. System Sci. 13 (1976) 335-379
5. Dawande M., Swaminathan J., Keskinocak P., and Tayur S. On bipartite and multipartite clique problems. J. Algorithms 41 (2001) 388-403
6. Eppstein D. Arboricity and bipartite subgraph listing algorithms. Inform. Process. Lett. 51 (1994) 207-211
7. Garey M., and Johnson D. Computers and Intractability, a Guide to the Theory of NP-Completeness (1979), W.H. Freeman, San Francisco, CA
8. Golumbic M.C., and Goss C.F. Perfect elimination and chordal bipartite graphs. J. Graph Theory 2 (1978) 155-163
9. Hochbaum D.S. Approximating clique and biclique problems. J. Algorithms 29 1 (1998) 174-200
10. Kloks T., and Kratsch D. Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph. Inform. Process. Lett. 55 (1995) 11-16
11. K. Makino, T. Uno, New algorithms for enumerating all maximal cliques, in: Proceedings of the Ninth Scandinavian Workshop on Algorithm Theory (SWAT2004), Lecture Notes in Computer Science, vol. 3111, 2004, p. 260-272.
12. Peeters R. The maximum edge biclique problem is NP-complete. Discrete Appl. Math. 131 (2003) 651-654
13. E. Prisner, Bicliques in graphs 2: recognizing k-path graphs and underlying graphs of line digraphs, in: Proceedings of WG97, Lecture Notes in Computer Science, vol. 1335, 1997, pp. 273-287.
14. Prisner E. Bicliques in graphs 1: bounds on their number. Combinatorica 20 1 (2000) 109-117
15. Tuza Z. Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices. Combinatorica 4 1 (1984) 111-116
16. Yannakakis M. Node and edge deletion NP-complete problems. Proceedings of the 10th Annual ACM Symposium on Theory of Computing (1978), Association for Computing Machinery, New York 253-264