Shortest k-disjoint paths via determinants
From MaRDI portal
Publication:5090955
DOI10.4230/LIPICS.FSTTCS.2018.19MaRDI QIDQ5090955FDOQ5090955
Authors: Samir Datta, Siddharth Iyer, Raghav Kulkarni, A. Mukherjee 
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1802.01338
Recommendations
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)
Cites Work
- Title not available (Why is that?)
- The directed subgraph homeomorphism problem
- Graph minors. XIII: The disjoint paths problem
- On the complexity of the disjoint paths problem
- Matching is as easy as matrix inversion
- On the Computational Complexity of Combinatorial Problems
- Graph minors. VI. Disjoint paths across a disc
- On shortest disjoint paths in planar graphs
- Finding k Disjoint Paths in a Directed Planar Graph
- Fast Parallel Matrix Inversion Algorithms
- Graph minors. VII: Disjoint paths on a surface
- Length-bounded disjoint paths in planar graphs
- Title not available (Why is that?)
- Graphs of non-crossing perfect matchings
- The disjoint shortest paths problem
- Shortest two disjoint paths in polynomial time
- New hardness results for routing on disjoint paths
- The complexity of planarity testing
- On the complexity of the planar edge-disjoint paths problem with terminals on the outer boundary
- Shortest vertex-disjoint two-face paths in planar graphs
- Resolution of Hartmanis' conjecture for NL-hard sparse sets
- Improved approximation for node-disjoint paths in planar graphs
- Title not available (Why is that?)
- Almost polynomial hardness of node-disjoint paths in grids
- Planarity testing revisited
- Towards single face shortest vertex-disjoint paths in undirected planar graphs
Cited In (4)
This page was built for publication: Shortest \(k\)-disjoint paths via determinants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090955)
