The following pages link to (Q5743390):
Displaying 13 items.
- A substring-substring LCS data structure (Q1625599) (← links)
- Constant query time \((1 + \epsilon)\)-approximate distance oracle for planar graphs (Q1727393) (← links)
- Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs (Q1730234) (← 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)
- (Q5009573) (← links)
- (Q5088992) (← links)
- (Q5091049) (← links)
- Short and Simple Cycle Separators in Planar Graphs (Q5266605) (← links)
- (Q5743404) (← links)
- Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. (Q5874499) (← links)
- Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time (Q5886044) (← links)
- Distributed planar reachability in nearly optimal time (Q6535037) (← links)
