Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs
From MaRDI portal
Publication:6087215
DOI10.4230/lipics.isaac.2020.43OpenAlexW3116593181MaRDI QIDQ6087215
Till Fluschnik, Philipp Zschoche, Rolf Niedermeier, Carsten Schubert
Publication date: 14 November 2023
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2020/13387/pdf/LIPIcs-ISAAC-2020-43.pdf/
shortest pathsparameterized complexitykernelizationtemporal graphsconsecutive dissimilarityconsecutive similarityrepresentative sets in temporal graphs
Related Items (4)
Multistage graph problems on a global budget ⋮ Multistage vertex cover ⋮ FPT algorithms to compute the elimination distance to bipartite graphs and more ⋮ A simple rounding scheme for multistage optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Incremental list coloring of graphs, parameterized by conservation
- Paths of bounded length and their cuts: parameterized complexity and algorithms
- Deleting edges to restrict the size of an epidemic: a new application for treewidth
- Enumerating maximal cliques in link streams with durations
- The complexity of routing with collision avoidance
- The complexity of finding small separators in temporal graphs
- The parameterized complexity of the minimum shared edges problem
- Topology of series-parallel networks
- Deleting edges to restrict the size of an epidemic in temporal networks
- Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms
- Incremental Clustering and Dynamic Information Retrieval
- Kernelization Lower Bounds by Cross-Composition
- Changing Bases: Multistage Optimization for Matroids and Matchings
- Facility Location in Evolving Metrics
- Temporal Network Theory
- The complexity of satisfiability problems
- An Introduction to Temporal Graphs: An Algorithmic Perspective*
- Multistage Vertex Cover
- Connectivity and inference problems for temporal networks
- Temporal graph classes: a view through temporal separators
- Finding Temporal Paths Under Waiting Time Constraints.
This page was built for publication: Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs
