On packing arborescences in temporal networks

DOI10.1016/j.ipl.2014.10.005zbMath1304.05060OpenAlexW1985886670MaRDI QIDQ477677

Yasushi Kawase, Naoyuki Kamiyama

Publication date: 9 December 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2324/26869

zbMATH Keywords

graph algorithmspacking problemarborescencetemporal network

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

On packing time-respecting arborescences

Cites Work

• A note on disjoint arborescences
• Arc-disjoint in-trees in directed graphs
• Independent branchings in acyclic digraphs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• On Representatives of Subsets
• Preserving and Increasing Local Edge-Connectivity in Mixed Graphs
• Connectivity and inference problems for temporal networks

This page was built for publication: On packing arborescences in temporal networks