Consensus algorithms for the generation of all maximal bicliques

Discrete Applied Mathematics

Volumn 145, Issue 1 SPEC. ISS., 2004, Pages 11-21

  Alexe, Gabriela ^a   Alexe, Sorin ^a   Crama, Yves ^b   Foldes, Stephan ^c   Hammer, Peter L ^a   Simeone, Bruno ^d  

^a RUTGERS UNIVERSITY   (United States)

^b UNIVERSITY OF LIÈGE   (Belgium)

^c TAMPERE UNIVERSITY OF TECHNOLOGY   (Finland)

^d SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Algorithmic graph theory; Biclique; Consensus type algorithm; Incremental polynomial enumeration; Maximal complete bipartite subgraph

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; COMPUTATIONAL METHODS; FUNCTIONS; POLYNOMIALS; PROBLEM SOLVING;

ALGORITHMIC GRAPH THEORY; CONSENSUS-TYPE ALGORITHMS; INCREMENTAL POLYNOMIAL ENUMERATION; MAXIMAL COMPLETE BIPARTITE SUBGRAPHS;

GRAPH THEORY;

EID: 4944246884     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2003.09.004     Document Type: Conference Paper

References (43)

1. P. Agarwal, N. Alon, B. Aronov, S. Suri, Can visibility graphs be represented compactly? in: Proceedings of the Ninth ACM Symposium on Computational Geometry, 1993, pp. 338-347.
2. Aho A.V., Hopcroft J.E., Ullman J.D. The Design and Analysis of Computer Algorithms. 1974;Addison-Wesley Publishing Company, Reading.
3. Benzaken Cl., Boyd S., Hammer P.L., Simeone B. Adjoints of pure bidirected graphs. Congress. Numer. 39:1983;123-144.
4. Benzaken Cl., Hammer P.L., Simeone B. Some remarks on conflict graphs of quadratic pseudo-Boolean functions. Internat. Ser. Numer. Math. 55:1980;9-30.
5. J.-C. Bermond, Couvertures des arrêtes d'un graphe par des graphes bipartis complets, Preprint, Univ. De Paris Sud, Centre d'Orsay, Rapport de Recherche No. 10, 1978.
6. A. Blake, Canonical expressions in Boolean algebra, Ph. D. Thesis, University of Chicago, 1937.
7. Boros E., Crama Y., Hammer P.L. Polynomial-time inference of all valid implications for Horn and related formulae. Ann. Math. Artif. Intell. 1:1990;21-32.
8. Bylka S., Idzik A., Komar J. Bipartite subgraphs of graphs with maximum degree three. Graphs Combin. 15:1999;129-136.
9. Chang C.L., Lee R.C. Symbolic Logic and Mechanical Theorem Proving. 1973;Academic Press, New York, San Francisco, London.
10. Chung F.R.K. On the coverings of graphs. Discrete Math. 30:1980;89-93.
11. Chung F.R.K. On the decomposition of graphs. SIAM J. Algebraic Discrete Methods. 2:1981;1-12.
12. Chung F.R.K., Erdös P., Spencer J. On the decomposition of graphs into complete bipartite subgraphs. Stud. Pure Math. 1983;95-101.
13. Crama Y., Hammer P.L. Recognition of quadratic graphs and adjoints of bidirected graphs. Ann. New York Acad. Sci. 555:1989;140-149.
14. Dawande M., Keskinocak P., Swaminathan J., Tayur S. On the biclique and multi-partite clique problems. J. Algorithms. 41(2):2001;388-403.
15. Doherty F.C.C., Lundgren J.R., Siewert D.J. Biclique covers and partitions of bipartite graphs and digraphs and related matrix ranks of. {0,1} -matrices Congress. Numer. 136:1999;73-96.
16. Dulmage A.L., Mendelsohn N.S. Coverings of bipartite graphs. Canad. J. Math. 10:1958;517-534.
17. Ebenegger Ch., Hammer P.L., de Werra D. Pseudo-Boolean functions and stability of graphs. Ann. Discrete Math. 19:1984;83-97.
18. Eppstein D. Arboricity and bipartite subgraph listing algorithms. Inform. Process. Lett. 51:1994;207-211.
19. Foldes S., Hammer P.L. Disjunctive and conjunctive normal forms of pseudo-Boolean functions. Discrete Appl. Math. 107:2000;1-26.
20. Garey M.R., Johnson D.S. Computers and Intractability, A guide to the theory of NP-completeness. 1979;Freeman, San Francisco.
21. Glover F. Maximum matching in a convex bipartite graph. Naval Res. Logistics Q. 14:1967;313-316.
22. Golumbic M.C., Hammer P.L. Stability in circular arc graphs. J. Algorithms. 9:1988;314-320.
23. W.H. Haemers, Bicliques and eigenvalues, Research Memorandum FEW 783, Tilburg University, 1999.
24. P.L. Hammer, The conflict graph of a pseudo-Boolean function, Technical Report, Bell Laboratories, West Long Branch, NJ, 1978.
25. Hammer P.L., Mahadev N.V.R., de Werra D. The struction of a graph. application to CN-free graphs Combinatorica. 5:1985;141-147.
26. Hammer P.L., Mahadev N.V.R., de Werra D. Stability in CAN-free graphs. J. Combin. Theory Ser. B. 38:1985;23-30.
27. Hammer P.L., Simeone B. Quasimonotone Boolean functions and bistellar graphs. Ann. Discrete Math. 9:1980;107-119.
28. Hochbaum D.S. Approximating clique and biclique problems. J. Algorithms. 29:1998;174-200.
29. Johnson D.S. The NP-completeness column. an ongoing guide J. Algorithms. 8:1987;438-448.
30. Johnson D.S., Yannakakis M., Papadimitriou C.H. On generating all maximal independent sets. Inform. Process. Lett. 27:1988;119-123.
31. A. Kaufmann, E. Pichat, Méthodes mathématiques non numériques et leurs algorithmes, Algorithmes de Recherche des Eléments Maximaux, Tome I, Masson, Paris, 1977.
32. Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G. Generating all maximal independent sets. NP-hardness and polynomial-time algorithms SIAM J. Comput. 9:1980;558-565.
33. Y. Malgrange, Recherche des sous-matrices premières d'une matrice à coefficients binaries, Applications à certains problèmes de graphe, in: Deuxième Congrès de l'AFCALTI, October 1961, Gauthier-Villars, Paris, 1962, pp. 231-242.
34. Mehlhorn K. Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness. 1984;Springer, Berlin.
35. Papadimitriou C.H. Computational Complexity. 1994;Addison-Wesley, Reading, MA.
36. D.V. Pasechnik, Bipartite sandwiches: bounding the size of a maximum biclique, preprint, 1999.
37. Paull M.C., Unger S.H. Minimizing the number of states in incompletely specified sequential switching functions. IRE Trans. Electron. Comput. EC-8:1959;356-367.
38. Peeters R. The maximum edge biclique problem is NP-complete. Discrete Appl. Math. 131:2003;651-654.
39. Pichat E. The disangagement algorithm or a new generalization of the exclusion algorithm. Discrete Math. 17:1977;95-106.
40. Quine W. A way to simplify truth functions. Amer. Math. Monthly. 62:1955;627-631.
41. Tsukiyama S., Ide M., Ariyoshi H., Shirakawa I. A new algorithm for generating all the maximal independent sets. SIAM J. Comput. 6:1977;505-517.
42. Tuza Z. Covering of graphs by complete bipartite subgraphs. complexity of 0-1 matrices Combinatorica. 4:1984;111-116.
43. M. Yannakakis, Node- and edge-deletion NP-complete problems, Proceedings of the 10th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, New York, 1978, pp. 253-264.