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):
Displayed 9 items.
- 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)
- 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)
- (Q5111734) (← links)
- (Q5111739) (← links)
- Shortest-path queries in static networks (Q5176178) (← links)
- Short and Simple Cycle Separators in Planar Graphs (Q5266605) (← links)