کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
8903527 | 1632569 | 2017 | 6 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Simple Undirected Two-Commodity Integral Flow with a Unitary Demand
ترجمه فارسی عنوان
ساده یکپارچه بدون تقارن جریان با یک تقاضای واحد
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
چکیده انگلیسی
Even, Itai and Shamir (1976) proved that the simple two-commodity integral flow problem is NP-complete both in the directed and undirected cases. They showed the NP-completeness of the directed case even if the demand of one commodity is unitary. However, the complexity of the undirected case when one commodity has a demand bounded by a constant remained unknown since then. In this paper, we show the NP-completeness of Simple undirected two-commodity integral flow when the demand of one commodity is unitary, closing a forty-year complexity gap. Furthermore, we also prove the NP-completeness of a related problem, called k+1vertex-disjoint paths, which aims to determine whether an undirected graph admits k+1 vertex disjoint paths where k of those paths are between a given pair of vertices and one path is between another given pair of vertices.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Electronic Notes in Discrete Mathematics - Volume 62, November 2017, Pages 279-284
Journal: Electronic Notes in Discrete Mathematics - Volume 62, November 2017, Pages 279-284
نویسندگان
Alexsander A. Melo, Celina M.H. Figueiredo, Uéverton S. Souza,