Finding All Convex Cuts of a Plane Graph in Cubic Time.
Roland GlantzHenning MeyerhenkePublished in: CIAC (2013)
Keyphrases
- min cut
- strongly connected
- graph matching
- graph representation
- graph theory
- convex optimization
- graph theoretic
- graph model
- weighted graph
- convex hull
- random walk
- directed graph
- connected components
- graph structure
- graph cuts
- graph partitioning
- three dimensional
- maximum clique
- piecewise linear
- bipartite graph
- b spline
- video sequences