On Bounds for the k-Partitioning of Graphs.
Sergei L. BezrukovRobert ElsässerUlf-Peter SchroederPublished in: COCOON (1999)
Keyphrases
- graph partitioning
- upper bound
- lower bound
- spectral graph
- graph matching
- graph model
- tight bounds
- lower and upper bounds
- undirected graph
- graph theory
- neural network
- error bounds
- graph theoretic
- partitioning algorithm
- series parallel
- genetic algorithm
- graph clustering
- data sets
- weighted graph
- graph representation
- image segmentation
- search algorithm
- pattern recognition
- contingency tables
- graph mining
- vertex set
- labeled graphs
- probabilistic model