Algorithms and complexity for path covers of temporal DAGs
From MaRDI portal
Cites work
- A decomposition theorem for partially ordered sets
- Algorithmic graph theory and perfect graphs
- Algorithms for weakly triangulated graphs
- An introduction to temporal graphs: an algorithmic perspective
- COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
- Connectivity and inference problems for temporal networks
- Eulerian walks in temporal graphs
- Faster and unified algorithms for diameter reducing shortcuts and minimum chain covers
- Finding temporal paths under waiting time constraints
- How fast can we reach a target vertex in stochastic temporal graphs?
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- Improved algorithms for weakly chordal graphs
- Introduction to algorithms.
- Minimum chain cover in almost linear time
- Normal hypergraphs and the perfect graph conjecture
- Note on Dilworth's Decomposition Theorem for Partially Ordered Sets
- On packing arborescences in temporal networks
- On Path Cover Problems in Digraphs and Applications to Program Testing
- Parameterized algorithms
- Sparse dynamic programming on DAGs with small width
- Sparsifying, shrinking and splicing for minimum path cover in parameterized linear time
- Temporal network theory
- The Complexity of Transitively Orienting Temporal Graphs
- The temporal explorer who returns to the base
- Treewidth. Computations and approximations
- Weakly triangulated graphs
This page was built for publication: Algorithms and complexity for path covers of temporal DAGs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7241039)
