On packing arborescences in temporal networks

Naoyuki Kamiyama, Yasushi Kawase

Research output: Contribution to journalArticle

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.

Original languageEnglish
Pages (from-to)321-325
Number of pages5
JournalInformation Processing Letters
Volume115
Issue number2
DOIs
Publication statusPublished - Jan 1 2015

Fingerprint

Packing
Labels
Directed graphs
Arc of a curve
Directed Graph
Disjoint
Roots
Path

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications

Cite this

On packing arborescences in temporal networks. / Kamiyama, Naoyuki; Kawase, Yasushi.

In: Information Processing Letters, Vol. 115, No. 2, 01.01.2015, p. 321-325.

Research output: Contribution to journalArticle

Kamiyama, Naoyuki ; Kawase, Yasushi. / On packing arborescences in temporal networks. In: Information Processing Letters. 2015 ; Vol. 115, No. 2. pp. 321-325.
@article{0df19f76cc6e4939a1b9f256a35dd697,
title = "On packing arborescences in temporal networks",
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.",
author = "Naoyuki Kamiyama and Yasushi Kawase",
year = "2015",
month = "1",
day = "1",
doi = "10.1016/j.ipl.2014.10.005",
language = "English",
volume = "115",
pages = "321--325",
journal = "Information Processing Letters",
issn = "0020-0190",
publisher = "Elsevier",
number = "2",

}

TY - JOUR

T1 - On packing arborescences in temporal networks

AU - Kamiyama, Naoyuki

AU - Kawase, Yasushi

PY - 2015/1/1

Y1 - 2015/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84911868630&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84911868630&partnerID=8YFLogxK

U2 - 10.1016/j.ipl.2014.10.005

DO - 10.1016/j.ipl.2014.10.005

M3 - Article

AN - SCOPUS:84911868630

VL - 115

SP - 321

EP - 325

JO - Information Processing Letters

JF - Information Processing Letters

SN - 0020-0190

IS - 2

ER -