Partitioning a graph into two isomorphic pieces.
Anthony BonatoRichard J. NowakowskiPublished in: J. Graph Theory (2003)
Keyphrases
- partitioning algorithm
- graph partitioning
- directed graph
- graph representation
- graph theory
- weighted graph
- minimum cut
- subgraph isomorphism
- directed acyclic graph
- random walk
- graph theoretic
- graph matching
- graph clustering
- graph model
- normalized cut
- structured data
- dependency graph
- data sets
- graph databases
- undirected graph
- connected components
- minimum spanning tree
- maximum flow
- clustering method
- graph based algorithm
- stable set
- spectral graph