Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture.
Stéphane BessyStéphan ThomasséPublished in: J. Comb. Theory, Ser. B (2010)
Keyphrases
- partitioning algorithm
- graph partitioning
- normalized cut
- graph structure
- data sets
- connected components
- directed graph
- weighted graph
- spectral graph
- graph model
- graph mining
- vertex set
- structured data
- minimum cut
- graph theory
- graph representation
- random walk
- image segmentation
- min cut
- adjacency matrix
- graph structures
- stable set
- spanning tree
- graph search
- graph kernels
- graph theoretic
- directed acyclic graph
- theorem prover
- pairwise
- genetic algorithm