Computing Minimum Dilation Spanning Trees in Geometric Graphs.
Aléx F. BrandtMiguel F. A. de GaiowskiPedro J. de RezendeCid C. de SouzaPublished in: COCOON (2015)
Keyphrases
- spanning tree
- edge disjoint
- minimum cost
- minimum spanning tree
- minimum spanning trees
- undirected graph
- weighted graph
- minimum weight
- depth first search
- minimum total cost
- binary images
- edge weights
- geometric constraints
- mathematical morphology
- root node
- lower bound
- lowest cost
- special case
- morphological filters
- np hard
- morphological operations
- image processing
- directed graph
- geometric structure