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: LATIN (2014)
Keyphrases
- maximum clique
- maximal cliques
- maximal clique enumeration
- branch and bound algorithm
- graph theoretic
- graph structure
- graph properties
- graph theory
- undirected graph
- computational complexity
- graph matching
- directed graph
- independent set
- association graph
- memory requirements
- graph mining
- graph representation
- small world
- neural network
- bounded treewidth
- graph model
- complex networks
- decision problems
- pruning power
- uniform random
- weighted graph