Optimal Parametric Search on Graphs of Bounded Tree-Width

DOI10.1006/JAGM.1996.0816MaRDI QIDQ3128194zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Optimal parametric search on graphs of bounded tree-width
• Parametric Problems on Graphs of Bounded Tree-Width
• Parametric problems on graphs of bounded tree-width
• Linear-time algorithms for parametric minimum spanning tree problems on planar graphs
• scientific article; zbMATH DE number 4051021

Cited in

(6)

• Linear-time algorithms for parametric minimum spanning tree problems on planar graphs
• Decomposable multi-parameter matroid optimization problems.
• Parametric Problems on Graphs of Bounded Tree-Width
• Parametric problems on graphs of bounded tree-width
• Optimal parametric search on graphs of bounded tree-width
• Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3128194)