Pages that link to "Item:Q3801095"
From MaRDI portal
The following pages link to Fast Algorithms for Shortest Paths in Planar Graphs, with Applications (Q3801095):
Displaying 50 items.
- A simple linear algorithm for the edge-disjoint \((s, t)\)-paths problem in undirected planar graphs (Q287243) (← links)
- Constant time distance queries in planar unweighted graphs with subquadratic preprocessing time (Q359743) (← links)
- Approximation algorithms for maximum independent set of pseudo-disks (Q452004) (← links)
- Cycle bases in graphs characterization, algorithms, complexity, and applications (Q458496) (← links)
- Counting and sampling minimum cuts in genus \(g\) graphs (Q471138) (← links)
- I/O-efficient path traversal in succinct planar graphs (Q521807) (← links)
- Improved approximation algorithms for box contact representations (Q521820) (← links)
- The within-strip discrete unit disk cover problem (Q528480) (← links)
- Algorithms for approximate shortest path queries on weighted polyhedral surfaces (Q603866) (← links)
- Improved results on geometric hitting set problems (Q603882) (← links)
- Two-level heaps: a new priority queue structure with applications to the single source shortest path problem (Q607658) (← links)
- A survey of geodesic paths on 3D surfaces (Q654287) (← links)
- Dynamic algorithms for shortest paths in planar graphs (Q685367) (← links)
- Shortest path computations in source-deplanarized graphs (Q685480) (← links)
- Optimal deterministic algorithms for 2-d and 3-d shallow cuttings (Q728495) (← links)
- Balanced independent and dominating sets on colored interval graphs (Q831789) (← links)
- How to catch marathon cheaters: new approximation algorithms for tracking paths (Q832889) (← links)
- On the dilation spectrum of paths, cycles, and trees (Q833719) (← links)
- On the negative cost girth problem in planar networks (Q891820) (← links)
- Sublinear separators, fragility and subexponential expansion (Q896068) (← links)
- A distributed shortest path algorithm for a planar network (Q918205) (← links)
- Splitting (complicated) surfaces is hard (Q934027) (← links)
- Single source shortest paths in \(H\)-minor free graphs (Q986535) (← links)
- Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation (Q1028460) (← links)
- The planar multiterminal cut problem (Q1130183) (← links)
- A framework for 1-D compaction with forbidden region avoidance (Q1194311) (← links)
- On the integral plane two-commodity flow problem (Q1197891) (← links)
- Shortest path algorithms for nearly acyclic directed graphs (Q1274325) (← links)
- Minimal connected enclosures on an embedded planar graph (Q1283782) (← links)
- A fast algorithm for maximum integral two-commodity flow in planar graphs (Q1314324) (← links)
- Flow in planar graphs with vertex capacities (Q1317474) (← links)
- Call routing and the ratcatcher (Q1330799) (← links)
- On fast planning of suboptimal paths amidst polygonal obstacles in plane (Q1367531) (← links)
- Linear-time algorithms for parametric minimum spanning tree problems on planar graphs (Q1391297) (← links)
- Optimal decremental connectivity in planar graphs (Q1693990) (← links)
- Faster shortest paths in dense distance graphs, with applications (Q1698725) (← links)
- Fast and efficient solution of path algebra problems (Q1824392) (← 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)
- An efficient parallel algorithm for shortest paths in planar layered digraphs (Q1899220) (← links)
- Searching among intervals and compact routing tables (Q1913700) (← links)
- All-pairs-shortest-length on strongly chordal graphs (Q1923609) (← links)
- Faster approximate diameter and distance oracles in planar graphs (Q1999961) (← links)
- Computing optimal shortcuts for networks (Q2001454) (← links)
- Single-source shortest paths and strong connectivity in dynamic planar graphs (Q2051854) (← links)
- Non-crossing shortest paths in undirected unweighted planar graphs in linear time (Q2097216) (← links)
- Electrical flows over spanning trees (Q2097649) (← links)
- Local search is a PTAS for feedback vertex set in minor-free graphs (Q2197532) (← links)
- Minimum vertex cover in ball graphs through local search (Q2250102) (← links)
- Subregion graph: a path planning acceleration structure for characters with various motion types in very large environments (Q2288106) (← links)
