Spanning trees with few crossings in geometric and topological graphs.
Christian KnauerÉtienne SchrammAndreas SpillnerAlexander WolffPublished in: EuroCG (2005)
Keyphrases
- spanning tree
- minimum spanning tree
- reeb graph
- minimum spanning trees
- minimum cost
- undirected graph
- edge disjoint
- geometric objects
- topological information
- minimum weight
- weighted graph
- geometric information
- depth first search
- edge weights
- geometric structure
- minimum total cost
- multimedia
- graph theoretical
- graph theory
- root node
- approximation algorithms
- connected components
- random walk
- semi supervised