Beer path problems in temporal graphs

DOI10.1007/978-3-032-27732-9_16MaRDI QIDQ7363385zbMATH OpenFDO

Authors Andrea D'Ascenzo, Giuseppe F. Italiano, Sotiris Kanellopoulos, Anna Mpanti, Aris Pagourtzis, Christos Pergaminelis

Publication date 29 September 2026

Full work available at URL https://doi.org/10.1007/978-3-032-27732-9_16

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cites work

• A comprehensive survey on the generalized traveling salesman problem
• An introduction to temporal graphs: an algorithmic perspective
• Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach
• Graph spanners for group Steiner distances
• scientific article; zbMATH DE number 3278972 (Why is no real title available?)
• On temporal graph exploration
• Shortest beer path queries based on graph decomposition
• Shortest beer path queries in digraphs with bounded treewidth
• Shortest beer path queries in interval graphs
• Shortest beer path queries in outerplanar graphs
• Temporal flows in temporal networks
• Temporal network optimization subject to connectivity constraints

This page was built for publication: Beer path problems in temporal graphs

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