Exact Distance Oracles for Planar Graphs with Failing Vertices (Q5236314): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Importer (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1145/3511541 / rank
 
Normal rank
Property / published in
 
Property / published in: ACM Transactions on Algorithms / rank
 
Normal rank
Property / publication date
 
31 October 2023
Timestamp+2023-10-31T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 31 October 2023 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68-XX / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 7758412 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4232322645 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1807.05968 / rank
 
Normal rank
Property / zbMATH Keywords
 
planar graphs
Property / zbMATH Keywords: planar graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
distance oracles
Property / zbMATH Keywords: distance oracles / rank
 
Normal rank
Property / zbMATH Keywords
 
shortest paths
Property / zbMATH Keywords: shortest paths / rank
 
Normal rank
Property / zbMATH Keywords
 
Voronoi diagrams
Property / zbMATH Keywords: Voronoi diagrams / rank
 
Normal rank

Latest revision as of 05:29, 26 April 2024

scientific article; zbMATH DE number 7117476
Language Label Description Also known as
English
Exact Distance Oracles for Planar Graphs with Failing Vertices
scientific article; zbMATH DE number 7117476

    Statements

    Exact Distance Oracles for Planar Graphs with Failing Vertices (English)
    0 references
    0 references
    0 references
    0 references
    15 October 2019
    0 references
    31 October 2023
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    planar graphs
    0 references
    distance oracles
    0 references
    shortest paths
    0 references
    Voronoi diagrams
    0 references