scientific article; zbMATH DE number 7559396

DOI10.4230/LIPICS.MFCS.2020.25MaRDI QIDQ5089189zbMATH OpenFDO

Authors Alessio Conte, Pilu Crescenzi, Andrea Marino, Giulia Punzi

Publication date 18 July 2022

Full work available at URL https://doi.org/10.4230/LIPICS.MFCS.2020.25

zbMATH Keywords

directed acyclic graphminimal cutsetminimal separatortemporal graph

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• On finding separators in temporal split and permutation graphs
• On finding separators in temporal split and permutation graphs
• The complexity of finding small separators in temporal graphs
• The complexity of finding small separators in temporal graphs
• Edge-disjoint branchings in temporal digraphs
• Edge-Disjoint Branchings in Temporal Graphs

Cites work

• A fast algorithm for building lattices
• A paradigm for listing \((s,t)\)-cuts in 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
• An introduction to temporal graphs: an algorithmic perspective
• Analysis and enumeration. Algorithms for biological graphs
• Computing maximal cliques in link streams
• COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
• Enumerating maximal cliques in link streams with durations
• scientific article; zbMATH DE number 49666 (Why is no real title available?)
• scientific article; zbMATH DE number 1500572 (Why is no real title available?)
• scientific article; zbMATH DE number 1420907 (Why is no real title available?)
• scientific article; zbMATH DE number 961960 (Why is no real title available?)
• On the enumeration of bicriteria temporal paths
• Quasi-upward planarity
• Reliability of safety-critical systems. Theory and applications
• The complexity of finding small separators in temporal graphs

Cited in

(4)

• Simple, strict, proper, happy: a study of reachability in temporal graphs
• Invited paper: Simple, strict, proper, happy: a study of reachability in temporal graphs
• Isolated suborders and their application to counting closure operators
• Giant components in random temporal graphs

This page was built for publication:

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