Every rayless graph has an unfriendly partition.
Henning BruhnReinhard DiestelAgelos GeorgakopoulosPhilipp SprüsselPublished in: Electron. Notes Discret. Math. (2009)
Keyphrases
- partitioning algorithm
- vertex set
- normalized cut
- graph theory
- weighted graph
- graph partitioning
- directed graph
- graph structure
- graph search
- graph theoretic
- graph representation
- min cut
- random walk
- search engine
- data sets
- dependency graph
- real time
- graph structures
- stable set
- graph construction
- graph mining
- bipartite graph
- image segmentation
- information systems
- learning algorithm