Efficient vertex-label distance oracles for planar graphs (Q1743124): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q60143009, #quickstatements; #temporary_batch_1711055989931 |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1504.04690 / rank | |||
Normal rank | |||
Revision as of 22:29, 18 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient vertex-label distance oracles for planar graphs |
scientific article |
Statements
Efficient vertex-label distance oracles for planar graphs (English)
0 references
12 April 2018
0 references
planar graphs
0 references
approximate distance oracles
0 references
portals
0 references
shortest-path separators
0 references
