The worst-case time complexity for generating all maximal cliques (extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3106, Issue , 2004, Pages 161-170

  Tomita, Etsuji ^a   Tanaka, Akira ^a,b   Takahashi, Haruhisa ^a  

^a UNIVERSITY OF ELECTRO COMMUNICATIONS   (Japan)

^b Toyota Techno Service Corporation   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

ALL MAXIMAL CLIQUES; DEPTH FIRST SEARCH ALGORITHMS; EXTENDED ABSTRACTS; N-VERTEX GRAPH; PRUNING METHODS; S-ALGORITHMS; TIME COMPLEXITY; UNDIRECTED GRAPH;

GRAPH THEORY;

EID: 33749379347     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27798-9_19     Document Type: Article

References (14)

1. T. Akutsu, M. Hayashida, E. Tomita, J. Suzuki, and K. Horimoto: Protein threading with profiles and constraints, Proc. IEEE Symp. on Bioinformatics and Bioengineering (2004, to appear).
2. D. Bahadur K. C., T. Akutsu, E. Tomita, T. Seki, and A. Fujiyama: Point matching under non-uniform distortions and protein side chain packing based on efficient maximum clique algorithms, Genome Informatics 13 (2002) 143-152.
3. D. Bahadur K. C., T. Akutsu, E. Tomita, and T. Seki: Protein side-chain packing: A maximum edge weight clique algorithmic approach, Proc. Asia-Pacific Bioinformatics Conf. (2004) 191-200.
4. I. M. Bomze, M. Budinich, P. M. Pardalos, and M. Pelillo: The maximum clique problem. In: D.-Z. Du and P. M. Pardalos (eds.). Handbook of Combinatorial Optimization, Supplement vol. A, Kluwer Academic Publishers (1999) 1-74 .
5. C. Bron and J. Kerbosch: Algorithm 457, Finding all cliques of an undirected graph, Comm. ACM 16 (1973) 575-577.
6. N. Chiba and T. Nishizeki: Arboricity and subgraph listing algorithms, SIAM J. Comput. 14 (1985) 210-223.
7. M. Hattori, Y. Okuno, S. Goto, and M. Kanehisa: Development of a chemical structure comparison method for integrated analysis of chemical and genomic information in the metabolic pathways. J. Am. Chem. Soc. 125 (2003) 11853-11865.
8. S. Kobayashi, T. Kondo, K. Okuda, and E. Tomita: Extracting globally structure free sequences by local structure freeness, Proc. DNA9 (2003) 206.
9. 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 (1980) 558-565.
10. S. Mohseni-Zadeh, A. Louis, P. Brézellec, and J.-L. Risler: PHYTOPROT: a database of clusters of plant proteins, Nucleic Acids Res. 32 (2004) D351-D353.
11. J. W. Moon and L. Moser: On cliques in graphs, Israel J. Math. 3 (1965) 23-28.
12. E. Tomita and T. Seki: An efficient branch-and-bound algorithm for finding a maximum clique, DMTCS 2003, Lec. Notes in Comput. Sci. 2731 (2003) 278-289.
13. E. Tomita, A. Tanaka, and H. Takahashi: An optimal algorithm for finding all the cliques, Technical Report of IPSJ, 1989-AL-12 (1989) 91-98.
14. S. Tsukiyama, M. Ide, H. Ariyoshi, and I. Shirakawa: A new algorithm for generating all the maximal independent sets, SIAM J. Comput. 6 (1977) 505-517.