Optimal Parametric Search on Graphs of Bounded Tree-Width

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.

• Type: Conference
• Year: 1994
• Where: SWAT
• Authors: David Fernández-Baca, Giora Slutzki
• Keywords: Algorithms, Parametric Search, Parametric Search Problems, SWAT 1994, Weighted Graphs