| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10331911 | Information Processing Letters | 2015 | 5 Pages |
Abstract
A temporal network is a directed graph in which each arc has a time label specifying the time at which its end vertices communicate. An arborescence in a temporal network is said to be time-respecting, if the time labels on every directed path from the root in this arborescence are monotonically non-decreasing. In this paper, we consider a characterization of the existence of arc-disjoint time-respecting arborescences in temporal networks.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Naoyuki Kamiyama, Yasushi Kawase,