Another Look at the Erdos-Hajnal-Pósa Results on Partitioning Edges of the Rado Graph.
Norbert SauerPublished in: Comb. (2001)
Keyphrases
- vertex set
- directed graph
- weighted graph
- graph partitioning
- undirected graph
- spanning tree
- partitioning algorithm
- simulated annealing
- directed acyclic graph
- graph model
- spectral embedding
- normalized cut
- edge weights
- minimum cut
- spectral graph
- connected components
- graph databases
- structured data
- random walk
- massive graphs
- graph theoretic
- stable set
- directed edges
- min cut
- genetic algorithm
- nodes of a graph
- graph search
- graph construction
- random graphs
- minimum cost
- bipartite graph
- optimal solution
- image segmentation
- social networks