Tree spanners on chordal graphs: complexity and algorithms.
Andreas BrandstädtFeodor F. DraganHoàng-Oanh LeVan Bang LePublished in: Theor. Comput. Sci. (2004)
Keyphrases
- worst case
- graph theory
- computational complexity
- computational cost
- memory requirements
- data structure
- polynomial time complexity
- learning algorithm
- theoretical analysis
- index structure
- connected components
- graphical models
- lower bound
- space complexity
- spanning tree
- complexity analysis
- minimum spanning tree
- representational power