On packing time-respecting arborescences
From MaRDI portal
Publication:2172082
DOI10.1016/J.DISOPT.2022.100702OpenAlexW4225130237MaRDI QIDQ2172082
Romain Chapoullié, Zoltán Szigeti
Publication date: 15 September 2022
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2203.01096
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- On packing arborescences in temporal networks
- Clustering to minimize the maximum intercluster distance
- The directed subgraph homeomorphism problem
- Preserving and Increasing Local Edge-Connectivity in Mixed Graphs
- On a Combinatorial Problem of Erdös and Hajnal
- Connectivity and inference problems for temporal networks
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On packing time-respecting arborescences
