Making the interval membership width of temporal graphs connected and bidirectional

DOI10.1016/J.JCSS.2025.103684MaRDI QIDQ6924412zbMATH OpenFDO

Authors Filippos Christodoulou, Pilu Crescenzi, Andrea Marino, Ana Silva, Dimitrios M. Thilikos

Publication date 29 September 2025

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JCSS.2025.103684

zbMATH Keywords

Eulerian trailsfirefighterparameterized complexitytemporal coloringtemporal graphswidth measures

Mathematics Subject Classification ID

Parameterized complexity, tractability and kernelization (68Q27) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• An introduction to temporal graphs: an algorithmic perspective
• As Time Goes By: Reflections on Treewidth for Temporal Graphs
• Coloring 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
• Efficiency of a Good But Not Linear Set Union Algorithm
• Eulerian walks in temporal graphs
• Exploration of periodically varying 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
• On Computing the Diameter of (Weighted) Link Streams
• Parameterized algorithms
• The Firefighter problem: a survey of results, directions and questions

This page was built for publication: Making the interval membership width of temporal graphs connected and bidirectional

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