Spanning Trees as Approximation of Data Structures.
Daniel AlcaideJan AertsPublished in: IEEE Trans. Vis. Comput. Graph. (2021)
Keyphrases
- spanning tree
- data structure
- minimum cost
- edge disjoint
- minimum spanning tree
- approximation algorithms
- searching in metric spaces
- minimum spanning trees
- approximation error
- undirected graph
- error bounds
- data types
- graph theory
- frequent patterns
- depth first search
- minimum total cost
- worst case
- closed form
- root node
- efficient data structures
- data management