scientific article; zbMATH DE number 7559396

DOI10.4230/LIPIcs.MFCS.2020.25MaRDI QIDQ5089189

Andrea Marino, Alessio Conte, Pierluigi Crescenzi, Giulia Punzi

Publication date: 18 July 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

directed acyclic graphminimal cutsetminimal separatortemporal graph

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

Simple, strict, proper, happy: a study of reachability in temporal graphs ⋮ Invited paper: Simple, strict, proper, happy: a study of reachability in temporal graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing maximal cliques in link streams
• Quasi-upward planarity
• A fast algorithm for building lattices
• Enumerating maximal cliques in link streams with durations
• A paradigm for listing \((s,t)\)-cuts in graphs
• The complexity of finding small separators in temporal graphs
• On the enumeration of bicriteria temporal paths
• Analysis and enumeration. Algorithms for biological graphs
• Algorithms for Core Stability, Core Largeness, Exactness, and Extendability of Flow Games
• An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset
• Reliability of Safety‐Critical Systems
• COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
• An Introduction to Temporal Graphs: An Algorithmic Perspective^*

This page was built for publication: