Login / Signup
On the number of edge disjoint cliques in graphs of given size.
Ervin Györi
Published in:
Comb. (1991)
Keyphrases
</>
maximum number
small number
total length
grow exponentially
computational complexity
spanning tree
undirected graph
maximal cliques
memory requirements
space complexity
genetic algorithm
bayesian networks
search algorithm
graph matching
graph theory
weighted graph