Skip to main content
Conference Proceedings

Optimal parametric search on graphs of bounded tree-width

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1994) 824 LNCS 155-166
DOI: 10.1007/3-540-58218-5_14
2Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We give linear-time algorithms for a class of parametric search problems on weighted graphs of bounded tree-width. We also discuss the implications of our results to approximate parametric search on planar graphs.

Cite

CITATION STYLE

APA

Fernández-Baca, D., & Slutzki, G. (1994). Optimal parametric search on graphs of bounded tree-width. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 824 LNCS, pp. 155–166). Springer Verlag. https://doi.org/10.1007/3-540-58218-5_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free