Efficient vertex-label distance oracles for planar graphs (Q1743124): Difference between revisions

From MaRDI portal
Changed label, description and/or aliases in en, and other parts
Merged Item from Q2788994
aliases / en / 0aliases / en / 0
 
Efficient Vertex-Label Distance Oracles for Planar Graphs
description / endescription / en
 
scientific article; zbMATH DE number 6545969
Property / title
 
Efficient Vertex-Label Distance Oracles for Planar Graphs (English)
Property / title: Efficient Vertex-Label Distance Oracles for Planar Graphs (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1383.68065 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-319-28684-6_9 / rank
 
Normal rank
Property / published in
 
Property / published in: Approximation and Online Algorithms / rank
 
Normal rank
Property / publication date
 
26 February 2016
Timestamp+2016-02-26T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 26 February 2016 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6545969 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1957344337 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q60143013 / rank
 
Normal rank

Revision as of 09:27, 6 May 2024

scientific article; zbMATH DE number 6545969
  • Efficient Vertex-Label Distance Oracles for Planar Graphs
Language Label Description Also known as
English
Efficient vertex-label distance oracles for planar graphs
scientific article; zbMATH DE number 6545969
  • Efficient Vertex-Label Distance Oracles for Planar Graphs

Statements

Efficient vertex-label distance oracles for planar graphs (English)
0 references
Efficient Vertex-Label Distance Oracles for Planar Graphs (English)
0 references
0 references
0 references
0 references
0 references
12 April 2018
0 references
26 February 2016
0 references
0 references
0 references
planar graphs
0 references
approximate distance oracles
0 references
portals
0 references
shortest-path separators
0 references
0 references
0 references
0 references
0 references
0 references