How to contract an essentially 6-connected graph to a 5-connected graph.

Matthias Kriesell

Published in: Discret. Math. (2007)

Keyphrases

connected components
neighborhood graph
graph representation
graph theory
weighted graph
graph based algorithm
graph clustering
graph structure
structured data
random walk
real time
link analysis
spanning tree
bipartite graph
graph theoretic
maximum flow
case study