Parameterized restless temporal path

DOI10.1007/978-3-032-04700-7_7MaRDI QIDQ6852238zbMATH OpenFDO

Authors Justine Cauvi, Laurent Viennot

Publication date 26 February 2026

Full work available at URL https://doi.org/10.1007/978-3-032-04700-7_7

zbMATH Keywords

interval-membership-widthparameterized algorithmsrestless temporal pathstemporal graphs

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A contribution to the mathematical theory of epidemics.
• An introduction to temporal graphs: an algorithmic perspective
• Computing maximum matchings in temporal graphs
• COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
• Connectivity and inference problems for temporal networks
• Counting temporal paths
• Edge exploration of temporal graphs
• Feedback edge sets in temporal graphs
• Finding temporal paths under waiting time constraints
• Making life more confusing for firefighters
• Making the interval membership width of temporal graphs connected and bidirectional
• Network science. With Márton Pósfai
• Networks
• Restless temporal path parameterized above lower bounds
• Temporal cliques admit sparse spanners
• Temporal vertex cover with a sliding time window
• The temporal explorer who returns to the base
• Three Partition Refinement Algorithms
• Traveling salesman problems in temporal graphs

This page was built for publication: Parameterized restless temporal path

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