The complexity of finding small separators in temporal graphs
From MaRDI portal
Publication:2009634
Recommendations
Cites work
- An introduction to temporal graphs: an algorithmic perspective
- Cluster Editing in Multi-Layer and Temporal Graphs.
- Computing maximal cliques in link streams
- Connectivity and inference problems for temporal networks
- Easy problems for tree-decomposable graphs
- Faster exploration of degree-bounded temporal graphs
- Fractals for kernelization lower bounds
- Fundamentals of parameterized complexity
- Graph structure and monadic second-order logic. A language-theoretic approach
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 961960 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- Interdiction problems on planar graphs
- Introduction to algorithms.
- Length-bounded cuts and flows
- Maximal Flow Through a Network
- Mengerian theorems for paths of bounded length
- Most vital links and nodes in weighted networks
- Network flows. Theory, algorithms, and applications.
- On the size and the approximability of minimum temporally connected subgraphs
- Parameterized algorithms
- Parametrized complexity theory.
- Paths of bounded length and their cuts: parameterized complexity and algorithms
- Temporal network optimization subject to connectivity constraints
- Temporal vertex cover with a sliding time window
- The complexity of finding small separators in temporal graphs
- The complexity of optimal design of temporally connected graphs
- Traveling salesman problems in temporal graphs
Cited in
(61)- Finding temporal paths under waiting time constraints
- Sliding window temporal graph coloring
- A faster parameterized algorithm for temporal matching
- The complexity of finding temporal separators under waiting time constraints
- Finding colorful paths in temporal graphs
- Mengerian temporal graphs revisited
- Maximum 0-1 timed matching on temporal graphs
- On short fastest paths in temporal graphs
- Deleting edges to restrict the size of an epidemic in temporal networks
- Optimizing reachability sets in temporal graphs by delaying
- Towards classifying the polynomial-time solvability of temporal betweenness centrality
- Parameterised temporal exploration problems
- On Temporally Connected Graphs of Small Cost
- The complexity of finding small separators in temporal graphs
- As Time Goes By: Reflections on Treewidth for Temporal Graphs
- scientific article; zbMATH DE number 7559396 (Why is no real title available?)
- Deleting edges to restrict the size of an epidemic in temporal networks
- ON THE HARDNESS OF RECOGNIZING BUNDLES IN TIME TABLE GRAPHS
- Exploration of \(k\)-edge-deficient temporal graphs
- Feedback edge sets in temporal graphs
- On finding separators in temporal split and permutation graphs
- Exploration of k-edge-deficient temporal graphs
- On finding separators in temporal split and permutation graphs
- Finding Temporal Paths Under Waiting Time Constraints.
- Mengerian graphs: characterization and recognition
- Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs
- Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality
- Multistage \(s-t\) path: confronting similarity with dissimilarity
- The complexity of growing a graph
- Disentangling the computational complexity of network untangling
- Invited paper: Simple, strict, proper, happy: a study of reachability in temporal graphs
- Untangling temporal graphs of bounded degree
- Computing maximum matchings in temporal graphs
- Timeline cover in temporal graphs: exact and approximation algorithms
- On computing large temporal (unilateral) connected components
- On computing optimal temporal branchings
- On computing large temporal (unilateral) connected components
- Temporal reachability minimization: delaying vs. deleting
- A new temporal interpretation of cluster editing
- Snapshot disjointness in temporal graphs
- Temporally connected components
- The complexity of growing a graph
- Cluster editing for multi-layer and temporal graphs
- On computing optimal temporal branchings and spanning subgraphs
- Exploiting automorphisms of temporal graphs for fast exploration and rendezvous
- Disjoint temporal walks under waiting time constraints
- Temporal graph realization from fastest paths
- An FPT algorithm for temporal graph untangling
- An FPT algorithm for timeline cover
- Exact and approximation algorithms for covering timeline in temporal graphs
- Temporal separators with deadlines
- Counting temporal paths
- The complexity of transitively orienting temporal graphs
- Resolving sets in temporal graphs
- Temporal graph realization with bounded stretch
- Temporal connectivity: coping with foreseen and unforeseen delays
- Temporal graph realization with bounded stretch
- Novel complexity results for temporal separators with deadlines
- Recognizing and realizing temporal reachability graphs
- Parameterized temporal exploration problems
- Temporal connectivity: coping with foreseen and unforeseen delays
This page was built for publication: The complexity of finding small separators in temporal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2009634)
