کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4647873 | 1342381 | 2013 | 7 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Independent arborescences in directed graphs
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
As a vertex-disjoint analogue of Edmonds' arc-disjoint arborescences theorem, it was conjectured that given a directed graph D with a specified vertex r, there are k spanning arborescences rooted at r such that for every vertex v of D the k directed walks from r to v in these arborescences are internally vertex-disjoint if and only if for every vertex v of D there are k internally vertex-disjoint directed walks from r to v. Whitty (1987) [10] affirmatively settled this conjecture for kâ¤2, and Huck (1995) [6] constructed counterexamples for kâ¥3, and Huck (1999) [7] proved that the conjecture is true for every k when D is acyclic. In this paper, we generalize these results by using the concept of “convexity” which is introduced by Fujishige (2010) [4].
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Mathematics - Volume 313, Issue 4, 28 February 2013, Pages 453-459
Journal: Discrete Mathematics - Volume 313, Issue 4, 28 February 2013, Pages 453-459
نویسندگان
András Frank, Satoru Fujishige, Naoyuki Kamiyama, Naoki Katoh,