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 16 items.
- An efficient oracle for counting shortest paths in planar graphs (Q5918687) (← links)
- Capacitated discrete unit disk cover (Q5918931) (← links)
- Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees (Q5919104) (← links)
- Local search strikes again: PTAS for variants of geometric covering and packing (Q5919362) (← links)
- Many distances in planar graphs (Q5920250) (← links)
- Fault-tolerant distance labeling for planar graphs (Q5970814) (← links)
- An efficient oracle for counting shortest paths in planar graphs (Q5970820) (← links)
- Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees (Q5970916) (← links)
- Computing connected-\(k\)-subgraph cover with connectivity requirement (Q6111948) (← links)
- Geometric dominating-set and set-cover via local-search (Q6114477) (← links)
- (Q6179341) (← links)
- Efficient algorithms for shortest path queries in planar digraphs (Q6550542) (← links)
- Shortest path algorithms for nearly acyclic directed graphs (Q6550559) (← links)
- Bounded-degree plane geometric spanners in practice (Q6579765) (← links)
- PTASs for secure dominating set in planar graphs and growth-bounded graphs (Q6611035) (← links)
- Good \(r\)-divisions imply optimal amortized decremental biconnectivity (Q6614619) (← links)