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 - Feb 2015

All Science Journal Classification (ASJC) codes

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

Fingerprint Dive into the research topics of 'On packing arborescences in temporal networks'. Together they form a unique fingerprint.

  • Cite this