Pages that link to "Item:Q5495821"
From MaRDI portal
The following pages link to Structured recursive separator decompositions for planar graphs in linear time (Q5495821):
Displaying 21 items.
- Better distance labeling for unweighted planar graphs (Q832885) (← links)
- Optimal decremental connectivity in planar graphs (Q1693990) (← links)
- Faster shortest paths in dense distance graphs, with applications (Q1698725) (← links)
- Efficient vertex-label distance oracles for planar graphs (Q1743124) (← links)
- Single-source shortest paths and strong connectivity in dynamic planar graphs (Q2051854) (← links)
- Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths (Q2968519) (← links)
- Approximating the k-Level in Three-Dimensional Plane Arrangements (Q4604386) (← links)
- (Q5002738) (← links)
- (Q5009574) (← links)
- Min-Cost Flow in Unit-Capacity Planar Graphs (Q5075811) (← links)
- (Q5111734) (← links)
- Contracting a Planar Graph Efficiently (Q5111739) (← links)
- Shortest-path queries in static networks (Q5176178) (← links)
- Short and Simple Cycle Separators in Planar Graphs (Q5266605) (← 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)
- Fault-tolerant distance labeling for planar graphs (Q5918639) (← links)
- An efficient oracle for counting shortest paths in planar graphs (Q5918687) (← links)
- Fault-tolerant distance labeling for planar graphs (Q5970814) (← links)
- An efficient oracle for counting shortest paths in planar graphs (Q5970820) (← links)
- Better distance labeling for unweighted planar graphs (Q6103529) (← links)
