Pages that link to "Item:Q2496320"

The following pages link to Planar graphs, negative weight edges, shortest paths, and near linear time (Q2496320):

Displaying 37 items.

• Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs (Q396709) (← links)
• Computing large matchings in planar graphs with fixed minimum degree (Q553342) (← links)
• On the negative cost girth problem in planar networks (Q891820) (← links)
• Single source shortest paths in \(H\)-minor free graphs (Q986535) (← links)
• Faster shortest paths in dense distance graphs, with applications (Q1698725) (← 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)
• Dynamic approximate all-pairs shortest paths: breaking the \(O(mn)\) barrier and derandomization (Q2816298) (← links)
• Shortest paths in directed planar graphs with negative lengths (Q2930306) (← links)
• Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths (Q2968519) (← links)
• Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs (Q3012798) (← links)
• Paths of low weight in planar graphs (Q3527531) (← links)
• Engineering Route Planning Algorithms (Q3637315) (← links)
• (Q5002738) (← links)
• NC Algorithms for Weighted Planar Perfect Matching and Related Problems (Q5002779) (← links)
• (Q5009573) (← links)
• Decremental SPQR-trees for Planar Graphs (Q5009609) (← links)
• A fully dynamic approximation scheme for all-pairs shortest paths in planar graphs (Q5060135) (← links)
• Min-Cost Flow in Unit-Capacity Planar Graphs (Q5075811) (← links)
• (Q5088992) (← links)
• (Q5091049) (← links)
• (Q5092347) (← links)
• Shortest-path queries in static networks (Q5176178) (← links)
• Short and Simple Cycle Separators in Planar Graphs (Q5266605) (← links)
• Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time (Q5348455) (← links)
• (Q5743390) (← links)
• (Q5743404) (← links)
• Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic $\tilde{O}(n^{5/3})$ Time (Q5858646) (← links)
• Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. (Q5874499) (← links)
• Minimum Cuts in Surface Graphs (Q5885599) (← links)
• Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time (Q5886044) (← links)
• Accelerated Bend Minimization (Q5895514) (← links)
• Level-planar drawings with few slopes (Q5918472) (← links)
• Fault-tolerant distance labeling for planar graphs (Q5918639) (← links)
• Many distances in planar graphs (Q5920250) (← links)
• Fault-tolerant distance labeling for planar graphs (Q5970814) (← links)
• Distributed planar reachability in nearly optimal time (Q6535037) (← links)