scientific article; zbMATH DE number 7053391
From MaRDI portal
zbMath1418.68161MaRDI QIDQ5743515
Andreas Björklund, Nina Taslaman, Thore Husfeldt
Publication date: 10 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=2095255
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20)
Related Items
Cyclability in graph classes, On residual approximation in solution extension problems, On undirected two‐commodity integral flow, disjoint paths and strict terminal connection problems, Cyclability, connectivity and circumference, Parameterized algorithms for list \(K\)-cycle, Waypoint routing on bounded treewidth graphs, Clearing directed subgraphs by mobile agents. Variations on covering with paths, Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials, Walking through waypoints, On Proving Parameterized Size Lower Bounds for Multilinear Algebraic Models, Shortest Two Disjoint Paths in Polynomial Time, Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth, A fast parallel algorithm for minimum-cost small integral flows
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding paths of length \(k\) in \(O^{*}(2^k)\) time
- The directed subgraph homeomorphism problem
- The subgraph homeomorphism problem
- Dynamic programming meets the principle of inclusion and exclusion
- Detecting cycles through three fixed vertices in a graph
- A probabilistic remark on algebraic program testing
- Graph minors. XIII: The disjoint paths problem
- Narrow sieves for parameterized paths and packings
- Dynamic Programming Treatment of the Travelling Salesman Problem
- A Dynamic Programming Approach to Sequencing Problems
- A quick method for finding shortest pairs of disjoint paths
- An Improved Algorithm for Finding Cycles Through Elements
- Faster Algebraic Algorithms for Path and Packing Problems
- Limits and Applications of Group Algebras for Parameterized Problems
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- The subgraph homeomorphism problem
- Determinant Sums for Undirected Hamiltonicity
- Systems of distinct representatives and linear algebra
