A constructive, analytic approach to balanced, minimal separators on grids and undirected graphs.
Herbert GajewskiKlaus GärtnerPublished in: PPSC (2001)
Keyphrases
- undirected graph
- directed graph
- approximation algorithms
- directed acyclic graph
- connected components
- spanning tree
- graph structure
- disjoint paths
- complex networks
- minimum cost
- multicommodity flow
- markov models
- strongly connected
- vertex set
- undirected graphical models
- random graphs
- positive integer
- conditional random fields
- random walk
- worst case