On packing arborescences in temporal networks

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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Information processing letters 2015-02, Vol.115 (2), p.321-325
Hauptverfasser:	Kamiyama, Naoyuki, Kawase, Yasushi
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Arborescence Complexity theory Data processing Graph algorithms Graph theory Labels Networks Packing problem Roots Studies Temporal logic Temporal network
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!