From Graph Orientation to the Unweighted Maximum Cut.
Walid Ben-AmeurAntoine GlorieuxJosé NetoPublished in: COCOON (2016)
Keyphrases
- minimum cut
- edge weights
- graph theory
- graph representation
- planar graphs
- undirected graph
- graph structure
- maximum flow
- random walk
- directed graph
- graph theoretic
- stable set
- graph cuts
- scoring rules
- graph search
- graph model
- directed acyclic graph
- connected components
- position and orientation
- normalized cut
- vertex set
- graph partitioning
- shortest path problem
- min cut
- weighted graph
- gabor filters
- approximation algorithms