Walking through waypoints
From MaRDI portal
Publication:5918830
DOI10.1007/s00453-020-00672-zzbMath1436.68218OpenAlexW3001881194WikidataQ126330615 ScholiaQ126330615MaRDI QIDQ5918830
Stefan Schmid, Klaus-Tycho Foerster, Saeed Akhoondian Amiri
Publication date: 21 May 2020
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-020-00672-z
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Min-sum 2-paths problems
- Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs
- A note on multiflows and treewidth
- Not being (super)thin or solid is hard: A study of grid Hamiltonicity
- List edge multicoloring in graphs with few cycles
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- The directed subgraph homeomorphism problem
- Disjoint paths in graphs
- 2-linked graphs
- Paths, flows, and VLSI-layout. Proceedings of a meeting held from June 20 to July 1, 1988, at the University of Bonn, Germany
- Eulerian graphs and related topics. Part 1, Volume 2
- Detecting cycles through three fixed vertices in a graph
- Treewidth. Computations and approximations
- The disjoint shortest paths problem
- New algorithms for maximum disjoint paths based on tree-likeness
- Graph minors. XIII: The disjoint paths problem
- \textsc{Split Vertex Deletion} meets \textsc{Vertex Cover}: new fixed-parameter and exact exponential-time algorithms
- Finding edge-disjoint paths in partial \(k\)-trees
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
- A $c^k n$ 5-Approximation Algorithm for Treewidth
- An Approximation Algorithm for Path Computation and Function Placement in SDNs
- Multiflow Feasibility: An Annotated Tableau
- Shortest vertex-disjoint two-face paths in planar graphs
- Efficient Parallel Algorithms for Testingkand Finding Disjoints-tPaths in Graphs
- On two geometric problems related to the travelling salesman problem
- Online Admission Control and Embedding of Service Chains
- An Improved Algorithm for Finding Cycles Through Elements
- On the Complexity of Some Colorful Problems Parameterized by Treewidth
- On Shortest Disjoint Paths in Planar Graphs
- A Polynomial Solution to the Undirected Two Paths Problem
- Processor Efficient Parallel Algorithms for the Two Disjoint Paths Problem and for Finding a Kuratowski Homeomorph
- On the Computational Complexity of Combinatorial Problems
- Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
- Distributed algorithms for computing shortest pairs of disjoint paths
- Finding k Disjoint Paths in a Directed Planar Graph
- The complexity of finding maximum disjoint paths with length constraints
- Vertex Disjoint Paths in Upward Planar Graphs
- Shortest Two Disjoint Paths in Polynomial Time
- AN IMPROVED ALGORITHM FOR FINDING TREE DECOMPOSITIONS OF SMALL WIDTH
- On Routing Disjoint Paths in Bounded Treewidth Graphs
- A subexponential parameterized algorithm for Subset TSP on planar graphs
- Parameterized Algorithms
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- On-line path computation and function placement in SDNs
- Walking through waypoints
- The edge-disjoint paths problem is NP-complete for series-parallel graphs
This page was built for publication: Walking through waypoints
