scientific article; zbMATH DE number 7561701
From MaRDI portal
Publication:5092419
DOI10.4230/LIPIcs.MFCS.2019.57MaRDI QIDQ5092419
Jessica Enright, Kitty Meeks, Victor Zamaraev, George B. Mertzios
Publication date: 21 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (5)
As Time Goes By: Reflections on Treewidth for Temporal Graphs ⋮ Simple, strict, proper, happy: a study of reachability in temporal graphs ⋮ How fast can we reach a target vertex in stochastic temporal graphs? ⋮ Invited paper: Simple, strict, proper, happy: a study of reachability in temporal graphs ⋮ Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Traveling salesman problems in temporal graphs
- A simplified NP-complete satisfiability problem
- Computing maximal cliques in link streams
- Deleting edges to restrict the size of an epidemic: a new application for treewidth
- Temporal network optimization subject to connectivity constraints
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- The complexity of finding small separators in temporal graphs
- Temporal vertex cover with a sliding time window
- How fast can we reach a target vertex in stochastic temporal graphs?
- The complexity of optimal design of temporally connected graphs
- Parametrized complexity theory.
- On temporal graph exploration
- DMVP: Foremost Waypoint Coverage of Time-Varying Graphs
- Flooding Time of Edge-Markovian Evolving Graphs
- Deleting Edges to Restrict the Size of an Epidemic: A New Application for Treewidth
- Dynamical Processes on Complex Networks
- Exploration of Periodically Varying Graphs
- Complexity of Finding Embeddings in a k-Tree
- Randomized Rumor Spreading in Dynamic Graphs
- A linear time algorithm for finding tree-decompositions of small treewidth
- Cutwidth I: A linear time fixed parameter algorithm
- COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
- Connectivity and inference problems for temporal networks
- Temporal graph classes: a view through temporal separators
This page was built for publication:
