Partitioning a graph into two pieces, each isomorphic to the other or to its complement.
Miri Priesler (Moreno)Published in: Discret. Math. (2005)
Keyphrases
- graph partitioning
- partitioning algorithm
- structured data
- subgraph isomorphism
- graph representation
- random walk
- bipartite graph
- graph theory
- graph theoretic
- graph model
- graph structure
- graph databases
- graph matching
- graph based algorithm
- graph search
- minimum cut
- link analysis
- weighted graph
- vertex set
- spectral graph
- stable set
- search engine
- normalized cut
- ranking algorithm
- np hard
- lower bound