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: Theor. Comput. Sci. (2016)
Keyphrases
- maximum clique
- maximal cliques
- graph matching
- association graph
- maximal clique enumeration
- branch and bound algorithm
- graph theory
- undirected graph
- graph theoretic
- computational complexity
- neural network
- memory requirements
- weighted graph
- space complexity
- graph properties
- independent set
- graph databases
- graph clustering
- random graphs
- bipartite graph
- lower bound
- pruning power
- uniform random