Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs

Discrete Applied Mathematics

Volumn 86, Issue 2-3, 1998, Pages 125-144

  Amilhastre, J ^a   Vilarem, M C ^a   Janssen, P ^a  

^a LIRMM   (France)

Author keywords

Bipartite domino free graphs; Complete bipartite graphs (or bicliques); Galois lattice; Minimum biclique cover; Minimum biclique decomposition

Indexed keywords

EID: 0041762732     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(98)00039-0     Document Type: Article

References (18)

1. R. Ahuja, T.L. Magnanti, J.B. Orlin, Network Flows, Theory, Algorithms and Applications, Prentice-Hall, Englewood Cliffs, NJ, 1993.
2. J. Amilhastre, M.C. Vilarem, P. Janssen, Complexity of minimum biclique cover and decomposition for a class of bipartite graphs, Technical Report 96035, LIRMM, 1995.
3. J.P. Bordat, Calcul pratique du treillis de Galois d'une correspondance, Math. Sci. Hum. (96) (1986) 31-47.
4. A. Brandstädt, Special graph classes - a survey, Technical Report SM-DU-199, Schriftenreihe des Fachbereichs Mathematik, 1993.
5. P.C. Fishburn, P.L. Hammer, Bipartite dimensions and bipartite degrees of graphs, Technical Report 76, DIMACS, June 1993. Available at http://dimacs.rutgers.edu/TechnicalReports.
6. D.S. Franzblau, D.J. Kleitman, An algorithm for covering polygons with rectangles, Inform. Control 63 (1984) 164-189.
7. V. Froidure, Rangs des relations binaires, semigroupes de relations non ambigues, Ph.D. Thesis, Univ. Paris VI, June 1995.
8. M. Habib, L. Nourine, A new lattice-based heuristic for taxonomy encoding, Private communication, 1996.
9. Tao Jiang, B. Ravikumar, Minimal NFA Problems are hard, SIAM J. Comput. 22 (1993) 1117-1141.
10. T. Kloks, D. Kratsch, Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph, Inform. Process. Lett. 55 (1995) 11-16.
11. T. Kratzke, B. Reznick, D. West, Eigensharp Graphs: Decomposition into complete bipartite subgraphs, Trans. Amer. Math. Soc. 308 (2) (1988) 637-653.
12. A. Lubiw, The boolean basis problem and how to cover some polygons by rectangles, SIAM J. Discrete Math. 3 (1) (1990) 98-115.
13. A. Lubiw, A weighted min-max relation for intervals, J. Combin. Theory 53 (2) (1991) 151-172.
14. H. Müller, Alternating cycle-free matchings, Order (7) (1990) 11-21.
15. H. Müller, On edge perfectness and classes of bipartite graphs, Discrete Math. (149) (1996) 159-187.
16. D.S. Nau, G. Markowsky, M.A. Woodbury, D.B. Amos, A mathematical analysis of human leukocyte antigen serology, Math. Biosci. 40 (1978) 243-270.
17. J. Orlin, Containment in Graph Theory: covering graphs with cliques, Nederl. Akad. Wetensch. Indag. Math. 39 (1977) 211-218.
18. R. Wille, Restructuring lattice theory: an approach based on hierarchies of contexts, in: I. Rival (Ed.), Ordered Sets, NATO ASI, vol. 83, Reidel, Dordrecht, Holland, 1982, pp. 445-470.