Unfriendly partitions for graphs not containing a subdivision of an infinite clique.
Eli BergerPublished in: Comb. (2017)
Keyphrases
- independent set
- maximum clique
- graph properties
- graph theoretic
- quasi cliques
- graph matching
- graph mining
- directed graph
- multiresolution
- clustering algorithm
- maximum independent set
- graph theory
- weighted graph
- spanning tree
- subdivision scheme
- vertex set
- graph clustering
- graph representation
- graph partitioning
- bipartite graph
- np complete
- probabilistic model
- pattern recognition