Abstract
Two applications of sparsification to parametric computing are given. The first is a fast algorithm for enumerating all distinct minimum spanning trees in a graph whose edge weights vary linearly with a parameter. The second is an asymptotically optimal algorithm for the minimum ratio spanning tree problem, as well as other search problems, on dense graphs.
Cite
CITATION STYLE
Fernández-Baca, D., Slutzki, G., & Eppstein, D. (1996). Using sparsification for parametric minimum spanning tree problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1097, pp. 149–160). Springer Verlag. https://doi.org/10.1007/3-540-61422-2_128
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
