Shortest beer path queries in interval graphs

DOI10.4230/LIPICS.ISAAC.2022.59MaRDI QIDQ6602486zbMATH OpenFDO

Authors Rathish Das, Meng He, Eitan Kondratovsky, J. Ian Munro, Kaiyu Wu

Publication date 11 September 2024

Full work available at URL https://doi.org/10.4230/LIPICS.ISAAC.2022.59

zbMATH Keywords

beer pathinterval graph

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(3)

• The maximum beer flow problem
• Shortest beer path queries based on graph decomposition
• Graph spanners for group Steiner distances

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6602486)