Pages that link to "Item:Q5890838"
From MaRDI portal
The following pages link to Faster shortest-path algorithms for planar graphs (Q5890838):
Displaying 27 items.
- Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs (Q396709) (← links)
- A new approach for solving the network problems (Q505104) (← links)
- An algorithm for computing simple \(k\)-factors (Q987840) (← links)
- The planar multiterminal cut problem (Q1130183) (← links)
- A uniform approach to semi-dynamic problems on digraphs (Q1274321) (← links)
- Linear-time algorithms for parametric minimum spanning tree problems on planar graphs (Q1391297) (← links)
- Decomposable multi-parameter matroid optimization problems. (Q1401298) (← links)
- Semi-dynamic breadth-first search in digraphs (Q1589436) (← links)
- A linear-time algorithm for edge-disjoint paths in planar graphs (Q1842575) (← links)
- An external memory data structure for shortest path queries (Q1861568) (← links)
- Maximum matchings in planar graphs via Gaussian elimination (Q2369872) (← links)
- Improved algorithms for replacement paths problems in restricted graphs (Q2488196) (← links)
- Polynomial algorithms for (integral) maximum two-flows in vertex\(\backslash\)edge-capacitated planar graphs (Q2563924) (← links)
- Fast generation of some classes of planar graphs (Q2741325) (← links)
- Finding the k Shortest Paths (Q4210169) (← links)
- Optimally fast shortest path algorithms for some classes of graphs (Q4236113) (← links)
- On Algorithms Employing Treewidth for $L$-bounded Cut Problems (Q4637663) (← links)
- Shortest path queries in digraphs of small treewidth (Q4645182) (← links)
- Shortcutting Planar Digraphs (Q4862749) (← links)
- Encoding shortest paths in spatial networks (Q4894867) (← links)
- Semi-dynamic shortest paths and breadth-first search in digraphs (Q5047157) (← links)
- Linear-time algorithms for parametric minimum spanning tree problems on planar graphs (Q5096337) (← links)
- An efficient algorithm for shortest paths in vertical and horizontal segments (Q5096942) (← links)
- Faster shortest-path algorithms for planar graphs (Q5906822) (← links)
- Inserting Multiple Edges into a Planar Graph (Q6075710) (← links)
- Counting edges in a dag (Q6550536) (← links)
- Efficient algorithms for shortest path queries in planar digraphs (Q6550542) (← links)
