Work

New Algorithms for Enumerating All Maximal Cliques

Year: 2004

Type: conference-paper

Source: Lecture notes in computer science

Parent work: Algorithm Theory - SWAT 2004: 9th Scandinavian Workshop on Algorithm Theory, Humlebæk, Denmark, July 8-10, 2004. Proceedings

DOI: 10.1007/978-3-540-27810-8_23

Authors: Kazuhisa Makino, Takeaki Uno

Institutions: The University of Osaka, National Institute of Informatics

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W1868111879

FWCI: 6.313

Cites: 26

Cited by: 419

Related to: 10