On the density of critical graphs with no large cliques.
Tom KellyLuke PostlePublished in: CoRR (2019)
Keyphrases
- maximal cliques
- graph structure
- weighted graph
- maximum clique
- graph matching
- graph theory
- graph model
- graph representation
- graph mining
- graph databases
- low density
- series parallel
- graph theoretic
- graph partitioning
- association graph
- protein interaction networks
- graph structures
- graph clustering
- minimum spanning tree
- neural network
- undirected graph
- pairwise
- learning algorithm