scientific article; zbMATH DE number 7561373
From MaRDI portal
Publication:5091009
DOI10.4230/LIPIcs.ISAAC.2018.19MaRDI QIDQ5091009
Andreas Björklund, Thore Husfeldt
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1806.07586
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On shortest disjoint paths in planar graphs
- Tree metrics and edge-disjoint \(S\)-paths
- Shortest \((A+B)\)-path packing via hafnian
- On computing the determinant in small parallel time using a small number of processors
- Matching theory
- Matching is as easy as matrix inversion
- An efficient parallel algorithm for planarity
- NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems
- Disjoint paths in graphs
- 2-linked graphs
- On the theory of Pfaffian orientations. II: \(T\)-joins, \(k\)-cuts, and duality of enumeration
- Solving the 2-disjoint paths problem in nearly linear time
- The Complexity of Counting in Sparse, Regular, and Planar Graphs
- Modern Computer Algebra
- A shorter proof of the graph minor algorithm
- Planar Disjoint-Paths Completion
- Shortest vertex-disjoint two-face paths in planar graphs
- A taxonomy of problems with fast parallel algorithms
- Generalized Nested Dissection
- 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
- Fast Parallel Matrix Inversion Algorithms
- Planar Graph Perfect Matching Is in NC
- Shortest Two Disjoint Paths in Polynomial Time
- Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen
- Optimization via enumeration: A new algorithm for the max cut problem
This page was built for publication:
