On finding separators in temporal split and permutation graphs
From MaRDI portal
Publication:5925700
DOI10.1016/j.jcss.2023.01.004OpenAlexW3164856871MaRDI QIDQ5925700
Nicolas Maack, Hendrik Molter, Rolf Niedermeier, Malte Renken
Publication date: 21 April 2023
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.2023.01.004
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved upper bounds for vertex cover
- On a graph partition problem with application to VLSI layout
- Temporal network optimization subject to connectivity constraints
- Algorithmic graph theory and perfect graphs
- Finding temporal paths under waiting time constraints
- The complexity of finding small separators in temporal graphs
- A faster parameterized algorithm for temporal matching
- The complexity of finding temporal separators under waiting time constraints
- Assigning times to minimise reachability in temporal graphs
- On temporal graph exploration
- Deleting edges to restrict the size of an epidemic in temporal networks
- Towards classifying the polynomial-time solvability of temporal betweenness centrality
- Minimal Split Completions of Graphs
- Graph Classes: A Survey
- Treewidth and Pathwidth of Permutation Graphs
- As Time Goes By: Reflections on Treewidth for Temporal Graphs
- Parameterized and Exact Computation
- Permutation Graphs and Transitive Graphs
- COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
- A NEW MEASURE OF RANK CORRELATION
- Connectivity and inference problems for temporal networks
- Temporal graph classes: a view through temporal separators
- Feedback edge sets in temporal graphs
- Edge exploration of temporal graphs
- On finding separators in temporal split and permutation graphs
This page was built for publication: On finding separators in temporal split and permutation graphs
