Edge-clique graphs of cocktail parties have unbounded rankwidth
Maw-Shang ChangTon KloksChing-Hao LiuPublished in: CoRR (2012)
Keyphrases
- weighted graph
- independent set
- maximum weight
- undirected graph
- maximum clique
- graph properties
- quasi cliques
- privacy preserving
- edge weights
- graph structure
- graph theoretic
- minimum spanning trees
- graph matching
- edge detection
- edge detector
- directed graph
- maximum independent set
- random graphs
- graph clustering
- graph partitioning
- edge information
- multi party
- spanning tree
- graph databases
- vertex set
- adjacency graph
- approximation algorithms
- shortest path
- minimum weight
- graph model
- graph theory
- pairwise