Pages that link to "Item:Q1743124"
From MaRDI portal
The following pages link to Efficient vertex-label distance oracles for planar graphs (Q1743124):
Displaying 11 items.
- The nearest colored node in a tree (Q1698706) (← links)
- Succinct data structures for nearest colored node in a tree (Q1705642) (← links)
- Efficient vertex-label distance oracles for planar graphs (Q1743124) (← links)
- (Q2788994) (redirect page) (← links)
- Improved Distance Oracles and Spanners for Vertex-Labeled Graphs (Q2912852) (← links)
- Fast and Compact Oracles for Approximate Distances in Planar Graphs (Q3527255) (← links)
- (Q5009638) (← links)
- Almost optimal distance oracles for planar graphs (Q5212755) (← links)
- Exact Distance Oracles for Planar Graphs with Failing Vertices (Q5236314) (← links)
- Compact oracles for reachability and approximate distances in planar digraphs (Q5435672) (← links)
- Efficient dynamic approximate distance oracles for vertex-labeled planar graphs (Q5915659) (← links)