Pages that link to "Item:Q5906822"

The following pages link to Faster shortest-path algorithms for planar graphs (Q5906822):

Displaying 50 items.

• A simple algorithm for replacement paths problem (Q327668) (← links)
• Faster replacement paths algorithms in case of edge or node failure for undirected, positive integer weighted graphs (Q396686) (← links)
• On shortest disjoint paths in planar graphs (Q429668) (← links)
• Counting and sampling minimum cuts in genus \(g\) graphs (Q471138) (← links)
• Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs (Q476424) (← links)
• Orthogonal graph drawing with flexibility constraints (Q476441) (← links)
• Computing the shortest essential cycle (Q603870) (← links)
• Link distance and shortest path problems in the plane (Q634253) (← links)
• Maximum flow in directed planar graphs with vertex capacities (Q634675) (← links)
• Planar and grid graph reachability problems (Q733742) (← links)
• A fast algorithm for minimum weight odd circuits and cuts in planar graphs (Q813970) (← links)
• Dynamic shortest paths and transitive closure: algorithmic techniques and data structures (Q849628) (← links)
• On the stabbing number of a random Delaunay triangulation (Q857055) (← links)
• On the negative cost girth problem in planar networks (Q891820) (← links)
• The inverse 1-maxian problem with edge length modification (Q941835) (← links)
• Exploiting planarity in separation routines for the symmetric traveling salesman problem (Q951094) (← links)
• On the domino-parity inequalities for the STSP (Q985309) (← links)
• Single source shortest paths in \(H\)-minor free graphs (Q986535) (← links)
• Localized and compact data-structure for comparability graphs (Q1025540) (← links)
• Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation (Q1028460) (← links)
• Maximum \((s,t)\)-flows in planar networks in \(\mathcal O(|V| \log |V|)\) time (Q1384532) (← links)
• Faster shortest paths in dense distance graphs, with applications (Q1698725) (← links)
• Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks (Q1730835) (← links)
• A dynamic programming approach for the pipe network layout problem (Q1735166) (← links)
• Efficient vertex-label distance oracles for planar graphs (Q1743124) (← links)
• How to draw the minimum cuts of a planar graph (Q1882854) (← links)
• A simpler and more efficient algorithm for the next-to-shortest path problem (Q1939658) (← links)
• Faster approximate diameter and distance oracles in planar graphs (Q1999961) (← links)
• Non-crossing shortest paths in undirected unweighted planar graphs in linear time (Q2097216) (← links)
• Disk-based shortest path discovery using distance index over large dynamic graphs (Q2292955) (← links)
• Multicuts in planar and bounded-genus graphs with bounded number of terminals (Q2408168) (← links)
• Shortest paths in time-dependent FIFO networks (Q2428679) (← links)
• Fully dynamic all pairs shortest paths with real edge weights (Q2496318) (← links)
• Planar graphs, negative weight edges, shortest paths, and near linear time (Q2496320) (← links)
• A survey of the all-pairs shortest paths problem and its variants in graphs (Q2629565) (← links)
• Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms (Q2632017) (← links)
• Dynamic Approximate All-Pairs Shortest Paths: Breaking the $O(mn)$ Barrier and Derandomization (Q2816298) (← links)
• Algorithmic Techniques for Maintaining Shortest Routes in Dynamic Networks (Q2864176) (← 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)
• Planar Digraphs (Q3120437) (← links)
• GENERALIZING MONOTONICITY: ON RECOGNIZING SPECIAL CLASSES OF POLYGONS AND POLYHEDRA (Q3373056) (← links)
• Distance Labeling for Permutation Graphs (Q3439382) (← links)
• Towards Single Face Shortest Vertex-Disjoint Paths in Undirected Planar Graphs (Q3452786) (← links)
• Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs (Q3452835) (← links)
• Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities (Q3511369) (← links)
• FLOODING COUNTRIES AND DESTROYING DAMS (Q3575390) (← links)
• Link Distance and Shortest Path Problems in the Plane (Q3638449) (← links)
• Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs (Q4593248) (← links)
• (Q5009574) (← links)