All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs.

Glencora Borradaile David Eppstein Amir Nayyeri Christian Wulff-Nilsen

Published in: SoCG (2016)

Keyphrases

three dimensional
graph matching
spanning tree
pairwise
embedded systems
graph databases
d objects
range data
simple polygon
reeb graph
object surface
graph theory
surface reconstruction
minimum cost
graph mining
graph theoretic
graph clustering
surface features
worst case