Shortest beer path queries in outerplanar graphs

DOI10.1007/s00453-022-01045-4arXiv2110.15693OpenAlexW3217068374MaRDI QIDQ6103523

Michiel H. M. Smid, Saeed Mehrabi, Joyce Bacic

Publication date: 5 June 2023

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2110.15693

zbMATH Keywords

outerplanar graphsshortest pathsdistance oracle

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• An inverse-Ackermann type lower bound for online minimum spanning tree verification
• Computing on a free tree via complexity-preserving mappings
• Succinct indices for path minimum, with applications
• Parallel Shortcutting of Rooted Trees
• Fast Algorithms for Finding Nearest Common Ancestors
• I/O-Optimal Algorithms for Outerplanar Graphs

This page was built for publication: Shortest beer path queries in outerplanar graphs