The complexity of partitioning into disjoint cliques and a triangle-free graph.
Marin BougeretPascal OchemPublished in: Discret. Appl. Math. (2017)
Keyphrases
- graph partitioning
- weighted graph
- graph structure
- partitioning algorithm
- maximal cliques
- pairwise
- random walk
- maximum clique
- spectral graph
- decision problems
- graph representation
- computational complexity
- polynomial time complexity
- graph theoretic
- space complexity
- computational cost
- graph model
- graph mining
- graph theory
- bipartite graph
- edge weights
- normalized cut
- graph matching
- dependency graph
- directed graph
- connected components
- similarity measure