Enumerating spanners in directed temporal graphs

DOI10.1007/978-3-032-27732-9_15MaRDI QIDQ7363383zbMATH OpenFDO

Authors Lapo Cioni, Andrea Marino, Jason Schoeters, Takeaki Uno

Publication date 29 September 2026

Full work available at URL https://doi.org/10.1007/978-3-032-27732-9_15

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cites work

• A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs
• An introduction to temporal graphs: an algorithmic perspective
• Blackout-tolerant temporal spanners
• Computational aspects of monotone dualization: a brief survey
• COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
• Connectivity and inference problems for temporal networks
• Efficient enumeration of solutions produced by closure operations
• Enumerating disjunctions and conjunctions of paths and cuts in reliability theory
• Enumeration complexity
• Generating Minimal k-Vertex Connected Spanning Subgraphs
• Graph spanners: a tutorial review
• On computing optimal temporal branchings and spanning subgraphs
• Reverse search for enumeration
• Simple, strict, proper, happy: a study of reachability in temporal graphs
• Sparse temporal spanners with low stretch
• Temporal cliques admit sparse spanners
• The complexity of optimal design of temporally connected graphs

This page was built for publication: Enumerating spanners in directed temporal graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7363383)