Untangling temporal graphs of bounded degree

DOI10.1016/j.tcs.2023.114040OpenAlexW4381194317MaRDI QIDQ6165555

Riccardo Dondi

Publication date: 1 August 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2023.114040

zbMATH Keywords

computational complexitygraph algorithmsvertex covertemporal graphs

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Some APX-completeness results for cubic graphs
• The complexity of finding small separators in temporal graphs
• Temporal vertex cover with a sliding time window
• Sliding window temporal graph coloring
• Finding colorful paths in temporal graphs
• Königsberg sightseeing: Eulerian walks in temporal graphs
• The network-untangling problem: from interactions to activity timelines
• On temporal graph exploration
• An Introduction to Temporal Graphs: An Algorithmic Perspective
• Reducibility among Combinatorial Problems
• Connectivity and inference problems for temporal networks
• Temporal graph classes: a view through temporal separators
• The temporal explorer who returns to the base
• Edge exploration of temporal graphs

This page was built for publication: Untangling temporal graphs of bounded degree