Parametric problems on graphs of bounded tree-width

DOI10.1007/3-540-55706-7_26MaRDI QIDQ5056150zbMATH OpenOpenAlexFDO

Authors Giora Slutzki, David Fernández-Baca

Publication date 9 December 2022

Published in Algorithm Theory — SWAT '92 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-55706-7_26

zbMATH Keywords

composition operatorlower envelopeouterplanar graphparse treeSteiner tree

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Programming involving graphs or networks (90C35)

Recommendations

• Parametric Problems on Graphs of Bounded Tree-Width
• Optimal Parametric Search on Graphs of Bounded Tree-Width
• Optimal parametric search on graphs of bounded tree-width
• scientific article; zbMATH DE number 4051021
• Solving parametric problems on trees

Cites work

• A Fast Parametric Maximum Flow Algorithm and Applications
• Algorithms finding tree-decompositions of graphs
• An algorithm for outerplanar graphs with parameter
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
• Combinatorial Optimization with Rational Objective Functions
• Complexity of some parametric integer and network programming problems
• Computational complexity of parametric linear programming
• Easy problems for tree-decomposable graphs
• Graph minors. II. Algorithmic aspects of tree-width
• Graph minors. XIII: The disjoint paths problem
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 4060712 (Why is no real title available?)
• scientific article; zbMATH DE number 4095510 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1142299 (Why is no real title available?)
• Linear time algorithms for NP-hard problems restricted to partial k- trees
• Linear-time computation of optimal subgraphs of decomposable graphs
• Parametric Combinatorial Computing and a Problem of Program Module Distribution
• Slowing down sorting networks to obtain faster sorting algorithms
• Solving parametric problems on trees
• Some dynamic computational geometry problems
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs

Cited in

(13)

• scientific article; zbMATH DE number 992954 (Why is no real title available?)
• Optimal Parametric Search on Graphs of Bounded Tree-Width
• The parameterised complexity of list problems on graphs of bounded treewidth
• scientific article; zbMATH DE number 4051021 (Why is no real title available?)
• scientific article; zbMATH DE number 24420 (Why is no real title available?)
• An algorithm for outerplanar graphs with parameter
• Parametric Problems on Graphs of Bounded Tree-Width
• Solving parametric problems on trees
• scientific article; zbMATH DE number 1884458 (Why is no real title available?)
• Optimal parametric search on graphs of bounded tree-width
• Parameterized Approximation Schemes Using Graph Widths
• scientific article; zbMATH DE number 6292751 (Why is no real title available?)
• Dynamic algorithms for graphs with treewidth 2

This page was built for publication: Parametric problems 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 Q5056150)