On packing arborescences in temporal networks
type: Item
instance of: scholarly article
title: On packing arborescences in temporal networks
zbMATH Open document ID: 1304.05060
author: Naoyuki Kamiyama
author: Yasushi Kawase
published in: Information Processing Letters
publication date: 2014-12-09T00:00:00Z
full work available at URL: http://hdl.handle.net/2324/26869
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 6378679
zbMATH Keywords: graph algorithms
zbMATH Keywords: arborescence
zbMATH Keywords: temporal network
zbMATH Keywords: packing problem
MaRDI profile type: Publication
OpenAlex ID: W1985886670
cites work: Connectivity and inference problems for temporal networks
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: Independent branchings in acyclic digraphs
cites work: Arc-disjoint in-trees in directed graphs
cites work: A note on disjoint arborescences
cites work: Preserving and Increasing Local Edge-Connectivity in Mixed Graphs
cites work: On Representatives of Subsets
DOI: 10.1016/J.IPL.2014.10.005
Recommended article: Time–dependent Simple Temporal Networks: Properties and Algorithms
Recommended article: Temporal flows in temporal networks
Recommended article: A hybrid adjacency and time-based data structure for analysis of temporal networks
Recommended article: Temporal Network Theory
Recommended article: On packing time-respecting arborescences
Recommended article: Dynamic networks with multi-scale temporal structure
Recommended article: Connectivity and inference problems for temporal networks
Recommended article: Topological–temporal properties of evolving networks
description: scientific article; zbMATH DE number 6378679