Finding temporal paths under waiting time constraints
From MaRDI portal
Publication:1979453
Recommendations
Cites work
- A parameterized view on matroid optimization problems
- A simplified NP-complete satisfiability problem
- An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem
- An Adaptive Version of Brandes' Algorithm for Betweenness Centrality
- An introduction to temporal graphs: an algorithmic perspective
- COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
- Connectivity and inference problems for temporal networks
- Deleting edges to restrict the size of an epidemic in temporal networks
- Deterministic methods to find primes
- Efficient computation of representative families with applications in parameterized and exact algorithms
- Finding paths of length \(k\) in \(O^{*}(2^k)\) time
- Graph theory
- Half-integrality, LP-branching, and FPT algorithms
- How fast can we reach a target vertex in stochastic temporal graphs?
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- scientific article; zbMATH DE number 961960 (Why is no real title available?)
- Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review
- Introduction to algorithms.
- Kernelization Lower Bounds by Cross-Composition
- Network science. With Márton Pósfai
- Networks
- On the complexity of k-SAT
- On the expressivity of time-varying graphs
- On the parameterized complexity of multiple-interval graph problems
- On the size and the approximability of minimum temporally connected subgraphs
- Parameterized algorithms
- Parameterized complexity of conflict-free matchings and paths
- Proofs from THE BOOK
- Quasipolynomial representation of transversal matroids with applications in parameterized complexity
- Reducibility among combinatorial problems
- Representative families of product families
- Sparsity. Graphs, structures, and algorithms
- Temporal cliques admit sparse spanners
- Temporal network optimization subject to connectivity constraints
- Temporal network theory
- The complexity of finding small separators in temporal graphs
- The complexity of optimal design of temporally connected graphs
- The directed subgraph homeomorphism problem
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Which problems have strongly exponential complexity?
Cited in
(46)- A faster parameterized algorithm for temporal matching
- The complexity of finding temporal separators under waiting time constraints
- Finding colorful paths in temporal graphs
- Foremost non-stop journey arrival in linear time
- Reducing reachability in temporal graphs: towards a more realistic model of real-world spreading processes
- Mengerian temporal graphs revisited
- Maximum 0-1 timed matching on temporal graphs
- Towards classifying the polynomial-time solvability of temporal betweenness centrality
- Parameterised temporal exploration problems
- scientific article; zbMATH DE number 6672134 (Why is no real title available?)
- As Time Goes By: Reflections on Treewidth for Temporal Graphs
- Non-strict Temporal Exploration
- Edge exploration of temporal graphs
- Edge exploration of temporal graphs
- On finding separators in temporal split and permutation graphs
- Mengerian graphs: characterization and recognition
- Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality
- Multistage \(s-t\) path: confronting similarity with dissimilarity
- Simple, strict, proper, happy: a study of reachability in temporal graphs
- Sharp Thresholds in Random Simple Temporal Graphs
- Disentangling the computational complexity of network untangling
- Invited paper: Simple, strict, proper, happy: a study of reachability in temporal graphs
- Computing maximum matchings in temporal graphs
- On computing large temporal (unilateral) connected components
- Temporal reachability minimization: delaying vs. deleting
- Parameterized algorithmics for time-evolving structures: temporalizing and multistaging
- Cluster editing for multi-layer and temporal graphs
- On computing optimal temporal branchings and spanning subgraphs
- A general label setting algorithm and tractability analysis for the multiobjective temporal shortest path problem
- Parameterized restless temporal path
- Finding a minimum source set in temporal graphs
- Disjoint temporal walks under waiting time constraints
- Temporal graph realization from fastest paths
- On time-travel planning in dynamic graphs
- Making the interval membership width of temporal graphs connected and bidirectional
- Counting temporal paths
- The complexity of transitively orienting temporal graphs
- Making the interval membership width of temporal graphs connected and bidirectional
- Giant components in random temporal graphs
- Distance to transitivity: new parameters for taming reachability in temporal graphs
- Algorithms and complexity for path covers of temporal DAGs
- Structural parameters for dense temporal graphs
- Temporal queries for dynamic temporal forests
- Temporal connectivity: coping with foreseen and unforeseen delays
- Parameterized temporal exploration problems
- Temporal connectivity: coping with foreseen and unforeseen delays
This page was built for publication: Finding temporal paths under waiting time constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1979453)
