All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs.
Glencora BorradaileDavid EppsteinAmir NayyeriChristian Wulff-NilsenPublished in: CoRR (2014)
Keyphrases
- d objects
- pairwise
- three dimensional
- range data
- graph matching
- embedded systems
- spanning tree
- worst case
- surface reconstruction
- graph mining
- weighted graph
- minimum length
- subgraph isomorphism
- graph theoretic
- graph representation
- graph databases
- directed graph
- social networks
- complex structures
- bipartite graph
- object surface
- surface model
- normal vectors
- vector field
- laplace beltrami
- viewpoint
- simple polygon