Counting and Listing all Potential Maximal Cliques of a Graph

Abstract

We show that the number of potential maximal cliques for an arbitrary graph G on n vertices is O∗(1.8135n), and that all potential maximal cliques can be listed in O∗(1.8899n) time. As a consequence of this results, treewidth and minimum fill-in can be computed in O∗(1.8899n) time. 

Topics

1 Figure or Table

Cite this paper

@inproceedings{Villanger2005CountingAL, title={Counting and Listing all Potential Maximal Cliques of a Graph}, author={Yngve Villanger}, year={2005} }