Temporal graph realization from fastest paths
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3169205 (Why is no real title available?)
- scientific article; zbMATH DE number 2117210 (Why is no real title available?)
- scientific article; zbMATH DE number 2119749 (Why is no real title available?)
- scientific article; zbMATH DE number 795223 (Why is no real title available?)
- scientific article; zbMATH DE number 7559442 (Why is no real title available?)
- scientific article; zbMATH DE number 7759278 (Why is no real title available?)
- scientific article; zbMATH DE number 7724250 (Why is no real title available?)
- A fast algorithm for constructing trees from distance matrices
- A game of cops and robbers on graphs with periodic edge-connectivity
- An Almost Linear-Time Algorithm for Graph Realization
- Assigning times to minimise reachability in temporal graphs
- Augmenting Graphs to Meet Edge-Connectivity Requirements
- COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
- Composed degree-distance realizations of graphs
- Computing maximum matchings in temporal graphs
- Connectivity and inference problems for temporal networks
- Counting temporal paths
- Delay-robust routes in temporal graphs
- Deleting edges to restrict the size of an epidemic in temporal networks
- Distance matrix of a graph and its realizability
- Distance realization problems with applications to internet tomography
- Eccentric sequences and eccentric sets in graphs
- Eccentric sequences in graphs
- Efficiently realizing interval sequences
- Finding temporal paths under waiting time constraints
- Fundamentals of parameterized complexity
- Graph editing to a given degree sequence
- Graph realization of distance sets
- Integer Programming with a Fixed Number of Variables
- Invited paper: Simple, strict, proper, happy: a study of reachability in temporal graphs
- Linear-time certifying algorithms for near-graphical sequences
- Multi-Terminal Network Flows
- Multi-parameter analysis of finding minors and subgraphs in edge-periodic temporal graphs
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- On probe interval graphs
- On temporal graph exploration
- On the parameterized complexity of multiple-interval graph problems
- On the realization of a (p,s)-digraph with prescribed degrees
- Optimizing reachability sets in temporal graphs by delaying
- Parameterized algorithms
- Parameterized and Exact Computation
- Parametrized complexity theory.
- Temporal Reachability Minimization: Delaying vs. Deleting
- Temporal graph classes: a view through temporal separators
- Temporal network optimization subject to connectivity constraints
- The complexity of computing optimum labelings for temporal connectivity
- The complexity of finding small separators in temporal graphs
- The complexity of optimal design of temporally connected graphs
- The complexity of satisfiability problems
- The distance matrix of a graph and its tree realization
- The temporal explorer who returns to the base
- Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity
- Weighted graphs with distances in given ranges
- Zero-one matrices with zero trace
Cited in
(2)
This page was built for publication: Temporal graph realization from fastest paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6903544)
