Counting cliques and clique covers in random graphs.
Kashyap DixitMartin FürerPublished in: CoRR (2014)
Keyphrases
- random graphs
- maximum clique
- graph theoretic
- maximal cliques
- learning curves
- association graph
- phase transition
- community structure
- undirected graph
- graph theory
- branch and bound algorithm
- complex networks
- weighted graph
- small world
- junction tree
- functional modules
- ranking algorithm
- power law
- combinatorial optimization
- search algorithm
- attributed graphs
- graph structure