Finding all Convex Cuts of a Plane Graph in Cubic Time
Roland GlantzHenning MeyerhenkePublished in: CoRR (2013)
Keyphrases
- min cut
- graph representation
- three dimensional
- structured data
- directed graph
- random walk
- strongly connected
- connected components
- convex optimization
- directed acyclic graph
- weighted graph
- graph theoretic
- piecewise linear
- graph structure
- graph theory
- graph model
- neural network
- undirected graph
- graph partitioning
- adjacency matrix
- graph matching
- convex hull
- graph based algorithm