Parametric problems on graphs of bounded tree-width

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We consider optimization problems on weighted graphs where vertex and edge weights are polynomial functions of a parameter ʎ We show that, if a problem satisfies certain regularity properties and the underlying graph has bounded tree-width, the number of changes in the optimum solution is polynomially bounded. We also show that the description of the sequence of optimum solutions can be constructed in polynomial time and that certain parametric search problems can be solved in O(nlog n) time, where n is the number of vertices in the graph

Cite

CITATION STYLE

APA

Baca, D. F. Á. N., & Slutzki, G. (1992). Parametric problems 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. 621 LNCS, pp. 304–316). Springer Verlag. https://doi.org/10.1007/3-540-55706-7_26

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