Optimal Parametric Search on Graphs of Bounded Tree-Width

DOI10.1006/jagm.1996.0816zbMath0866.68029OpenAlexW2019566084MaRDI QIDQ3128194

Giora Slutzki, David Fernández Baca

Publication date: 6 July 1997

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://lib.dr.iastate.edu/cgi/viewcontent.cgi?article=1059&context=cs_techreports

zbMATH Keywords

parametric search problemsweighted graphs of bounded tree-width

Mathematics Subject Classification ID

Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Linear-time algorithms for parametric minimum spanning tree problems on planar graphs ⋮ Decomposable multi-parameter matroid optimization problems.

This page was built for publication: Optimal Parametric Search on Graphs of Bounded Tree-Width