Temporal separators with deadlines

DOI10.4230/LIPICS.ISAAC.2023.38MaRDI QIDQ6953180zbMATH OpenFDO

Authors Hovhannes A. Harutyunyan, Kamran Koupayi, Denis Pankratov

Publication date 24 July 2025

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

approximation algorithmsinapproximabilityvertex separatordeadlinesdynamic graphsvertex cutseparating settemporal graphs

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A data structure for dynamic trees
• A threshold of ln n for approximating set cover
• Algorithms on evolving graphs
• An introduction to temporal graphs: an algorithmic perspective
• Automata, Languages and Programming
• COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
• Connectivity and inference problems for temporal networks
• Constructive linear time algorithms for branchwidth
• Exploration of periodically varying graphs
• Graph minors. I. Excluding a forest
• Graph minors. X: Obstructions to tree-decomposition
• Introduction to algorithms.
• Multi-multiway cut problem on graphs of bounded branch width
• Multiway cuts in directed and node weighted graphs
• On covering segments with unit intervals
• On graph problems in a semi-streaming model
• Online algorithms: a survey
• Temporal graph classes: a view through temporal separators
• Temporal network optimization subject to connectivity constraints
• The complexity of finding small separators in temporal graphs

This page was built for publication: Temporal separators with deadlines

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