Parametric Problems on Graphs of Bounded Tree-Width

DOI10.1006/jagm.1994.1019zbMath0801.90114OpenAlexW2053278287MaRDI QIDQ4290915

Giora Slutzki, David Fernández Baca

Publication date: 5 May 1994

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

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

zbMATH Keywords

optimization problems on weighted graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (4)

Optimal parametric search on graphs of bounded tree-width ⋮ Fixed-Parameter Tractability of Treewidth and Pathwidth ⋮ On the complexity of time-dependent shortest paths ⋮ Linear-time algorithms for parametric minimum spanning tree problems on planar graphs

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