Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3.
Hélio B. Macêdo FilhoRaphael C. S. MachadoCelina M. H. de FigueiredoPublished in: CoRR (2013)
Keyphrases
- maximum clique
- maximal cliques
- graph theoretic
- maximal clique enumeration
- graph theory
- graph matching
- weighted graph
- undirected graph
- association graph
- computational complexity
- independent set
- bounded treewidth
- complex networks
- maximum independent set
- polynomial time complexity
- uniform random
- graph clustering
- attributed graphs
- graph databases
- graph mining
- memory requirements
- random walk