scientific article; zbMATH DE number 795221
From MaRDI portal
Publication:4845370
zbMath0831.05022MaRDI QIDQ4845370
Bienstock, Daniel, Michael A. Langston
Publication date: 11 September 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (12)
Definability in First Order Theories of Graph Orderings ⋮ Linear-time algorithms for problems on planar graphs with fixed disk dimension ⋮ A Basic Parameterized Complexity Primer ⋮ Fixed-Parameter Tractability of Treewidth and Pathwidth ⋮ On algorithmic applications of the immersion order: An overview of ongoing work presented at the Third Slovenian International Conference on Graph Theory ⋮ Finding disjoint paths with different path-costs: Complexity and algorithms ⋮ \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions ⋮ Tangle bases: Revisited ⋮ Improved kernels for tracking paths ⋮ LP Formulations for Polynomial Optimization Problems ⋮ Kernelization: New Upper and Lower Bound Techniques ⋮ New limits of treewidth-based tractability in optimization
This page was built for publication:
