scientific article; zbMATH DE number 7559396
From MaRDI portal
Publication:5089189
DOI10.4230/LIPICS.MFCS.2020.25MaRDI QIDQ5089189FDOQ5089189
Authors: Alessio Conte, Pilu Crescenzi, Andrea Marino, Giulia Punzi 
Publication date: 18 July 2022
Title of this publication is not available (Why is that?)
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
- Enumerating maximal cliques in link streams with durations
- Title not available (Why is that?)
- Title not available (Why is that?)
- COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
- An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset
- Quasi-upward planarity
- A fast algorithm for building lattices
- Title not available (Why is that?)
- An introduction to temporal graphs: an algorithmic perspective
- A paradigm for listing \((s,t)\)-cuts in graphs
- Computing maximal cliques in link streams
- Analysis and enumeration. Algorithms for biological graphs
- Algorithms for Core Stability, Core Largeness, Exactness, and Extendability of Flow Games
- Reliability of safety-critical systems. Theory and applications
- Title not available (Why is that?)
- The complexity of finding small separators in temporal graphs
- On the enumeration of bicriteria temporal paths
Cited In (3)
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)
