Asymptotically Almost Every 2r-Regular Graph Has an Internal Partition.
Nathan LinialSria LouisPublished in: Graphs Comb. (2020)
Keyphrases
- partitioning algorithm
- graph representation
- graph structure
- directed graph
- bipartite graph
- internal and external
- random walk
- min cut
- image segmentation
- weighted graph
- normalized cut
- graph model
- search algorithm
- minimum spanning tree
- graph theory
- sample size
- web graph
- undirected graph
- graph mining
- graph search
- graphical models
- stable set