Arc-disjoint in-trees in directed graphs

Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

Abstract

Given a directed graph D = (V, A) and a set of specified vertices S = {s1,... , Sd} ⊆ V with |S| = d and a function f: S → ℕ where ℕ denotes the set of natural numbers, we present a necessary and sufficient condition that there exist Σsi∈S f(si) arc-disjoint in-trees denoted by Ti,1,T i,2,...,Ti,f(si) for every i = 1,...,d such that Ti,1,..., Ti,f(si) are rooted at s i and each Ti,j spans vertices from which si is reachable. This generalizes the result of Edmonds [2], i.e., the necessary and sufficient condition that for a directed graph D = (V, A) with a specified vertex s ∈ V, there are k arc-disjoint in-trees rooted at s each of which spans V. Furthermore, we extend another characterization of packing in-trees of Edmonds [1] to the one in our case.

Original languageEnglish
Title of host publicationProceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms
Pages518-526
Number of pages9
Publication statusPublished - 2008
Externally publishedYes
Event19th Annual ACM-SIAM Symposium on Discrete Algorithms - San Francisco, CA, United States
Duration: Jan 20 2008Jan 22 2008

Other

Other19th Annual ACM-SIAM Symposium on Discrete Algorithms
CountryUnited States
CitySan Francisco, CA
Period1/20/081/22/08

Fingerprint

Directed graphs
Directed Graph
Disjoint
Arc of a curve
Necessary Conditions
Rooted Trees
Sufficient Conditions
Natural number
Packing
Denote
Generalise
Vertex of a graph

All Science Journal Classification (ASJC) codes

  • Software
  • Mathematics(all)

Cite this

Kamiyama, N., Katoh, N., & Takizawa, A. (2008). Arc-disjoint in-trees in directed graphs. In Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 518-526)

Arc-disjoint in-trees in directed graphs. / Kamiyama, Naoyuki; Katoh, Naoki; Takizawa, Atsushi.

Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms. 2008. p. 518-526.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kamiyama, N, Katoh, N & Takizawa, A 2008, Arc-disjoint in-trees in directed graphs. in Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms. pp. 518-526, 19th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, United States, 1/20/08.
Kamiyama N, Katoh N, Takizawa A. Arc-disjoint in-trees in directed graphs. In Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms. 2008. p. 518-526
Kamiyama, Naoyuki ; Katoh, Naoki ; Takizawa, Atsushi. / Arc-disjoint in-trees in directed graphs. Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms. 2008. pp. 518-526
@inproceedings{7dd9c8152fd74b319828908b1ce1ed0d,
title = "Arc-disjoint in-trees in directed graphs",
abstract = "Given a directed graph D = (V, A) and a set of specified vertices S = {s1,... , Sd} ⊆ V with |S| = d and a function f: S → ℕ where ℕ denotes the set of natural numbers, we present a necessary and sufficient condition that there exist Σsi∈S f(si) arc-disjoint in-trees denoted by Ti,1,T i,2,...,Ti,f(si) for every i = 1,...,d such that Ti,1,..., Ti,f(si) are rooted at s i and each Ti,j spans vertices from which si is reachable. This generalizes the result of Edmonds [2], i.e., the necessary and sufficient condition that for a directed graph D = (V, A) with a specified vertex s ∈ V, there are k arc-disjoint in-trees rooted at s each of which spans V. Furthermore, we extend another characterization of packing in-trees of Edmonds [1] to the one in our case.",
author = "Naoyuki Kamiyama and Naoki Katoh and Atsushi Takizawa",
year = "2008",
language = "English",
isbn = "9780898716474",
pages = "518--526",
booktitle = "Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms",

}

TY - GEN

T1 - Arc-disjoint in-trees in directed graphs

AU - Kamiyama, Naoyuki

AU - Katoh, Naoki

AU - Takizawa, Atsushi

PY - 2008

Y1 - 2008

N2 - Given a directed graph D = (V, A) and a set of specified vertices S = {s1,... , Sd} ⊆ V with |S| = d and a function f: S → ℕ where ℕ denotes the set of natural numbers, we present a necessary and sufficient condition that there exist Σsi∈S f(si) arc-disjoint in-trees denoted by Ti,1,T i,2,...,Ti,f(si) for every i = 1,...,d such that Ti,1,..., Ti,f(si) are rooted at s i and each Ti,j spans vertices from which si is reachable. This generalizes the result of Edmonds [2], i.e., the necessary and sufficient condition that for a directed graph D = (V, A) with a specified vertex s ∈ V, there are k arc-disjoint in-trees rooted at s each of which spans V. Furthermore, we extend another characterization of packing in-trees of Edmonds [1] to the one in our case.

AB - Given a directed graph D = (V, A) and a set of specified vertices S = {s1,... , Sd} ⊆ V with |S| = d and a function f: S → ℕ where ℕ denotes the set of natural numbers, we present a necessary and sufficient condition that there exist Σsi∈S f(si) arc-disjoint in-trees denoted by Ti,1,T i,2,...,Ti,f(si) for every i = 1,...,d such that Ti,1,..., Ti,f(si) are rooted at s i and each Ti,j spans vertices from which si is reachable. This generalizes the result of Edmonds [2], i.e., the necessary and sufficient condition that for a directed graph D = (V, A) with a specified vertex s ∈ V, there are k arc-disjoint in-trees rooted at s each of which spans V. Furthermore, we extend another characterization of packing in-trees of Edmonds [1] to the one in our case.

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

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

M3 - Conference contribution

SN - 9780898716474

SP - 518

EP - 526

BT - Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms

ER -