scientific article; zbMATH DE number 7561410
From MaRDI portal
Publication:5091049
Recommendations
- An efficient oracle for counting shortest paths in planar graphs
- An efficient oracle for counting shortest paths in planar graphs
- scientific article; zbMATH DE number 47435
- On the complexity of the disjoint paths problem
- On the computational complexity of path cover problems
- Oracles for bounded-length shortest paths in planar graphs
- The Parameterized Complexity of Counting Problems
- Counting problems in parameterized complexity
- The complexity of the counting constraint satisfaction problem
- The Complexity of the Counting Constraint Satisfaction Problem
Cites work
- A separator theorem for graphs of bounded genus
- A Separator Theorem for Planar Graphs
- Approximately counting approximately-shortest paths in directed acyclic graphs
- Approximately counting paths and cycles in a graph
- Better tradeoffs for exact distance oracles in planar graphs
- Calculating bounds on reachability and connectedness in stochastic networks
- Counting and sampling minimum (s,t)-cuts in weighted planar graphs in polynomial time
- Counting and sampling minimum cuts in genus g graphs
- Exact distance oracles for planar graphs
- Faster shortest-path algorithms for planar graphs
- Many distances in planar graphs
- On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs
- On the solution of linear recurrence equations
- Planar graphs, negative weight edges, shortest paths, and near linear time
- Planar spanners and approximate shortest path queries among obstacles in the plane
- Shortest path queries in planar graphs
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- The Complexity of Enumeration and Reliability Problems
- The Parameterized Complexity of Counting Problems
Cited in
(4)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5091049)
