Algorithmic and structural aspects of temporal graphs

DOI10.14279/DEPOSITONCE-17494MaRDI QIDQ6631258zbMATH OpenFDO

Authors Malte Renken

Publication date 1 November 2024

zbMATH Keywords

Voronoi gametemporal pathfeedback edge setrandom temporal graphisolated clique

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Connectivity (05C40) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43)

Recommendations

• An introduction to temporal graphs: an algorithmic perspective
• An introduction to temporal graphs: an algorithmic perspective
• Parameterized algorithmics for time-evolving structures: temporalizing and multistaging
• Optimizing reachability sets in temporal graphs by delaying
• Sharp Thresholds in Random Simple Temporal Graphs

Cited in

(1)

• Paths and connectivity in temporal graphs. Textbook for a mini course at the 34th Brazilian mathematics colloquium -- 34\degree Colóquio Brasileiro de Matemática, IMPA, Rio de Janeiro, Brazil, Juli 2023

This page was built for publication: Algorithmic and structural aspects of temporal graphs

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