vix.ing · top · new · best · stats · spec

Computing shortest paths and distances in planar graphs

1991/01/01 by Hristo Djidjev, Hristo N. Djidjev, Grammati Pantziou +3 · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Binary logarithm #Cardinality (data modeling) #Combinatorics #Complexity and Algorithms in Graphs #Computer science #Digraph #Discrete mathematics #Graph #Mathematics #Optimization and Search Problems #Path (computing) #Planar graph #Shortest path problem #Time complexity

paper · doi:10.1007/3-540-54233-7_145

crossref issued 1991/01/01 · crossref published 1991/01/01 · crossref published-print 1991/01/01 · openalex publication_date 1991/01/01 · crossref published-online 2005/06/08 · crossref created 2012/02/25 · crossref deposited 2021/12/31 · openalex created_date 2025/10/10 · crossref indexed 2025/12/16 · openalex updated_date 2026/07/29

Citations

Cited by