کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4669273 | 1346121 | 2009 | 17 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A new algorithm for the intersection of a line with the independent set polytope of a matroid
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A new algorithm for the intersection of a line with the independent set polytope of a matroid A new algorithm for the intersection of a line with the independent set polytope of a matroid](/preview/png/4669273.png)
چکیده انگلیسی
We present a new algorithm for the problem of determining the intersection of a half-line with the independent set polytope of a matroid. We show it can also be used to compute the strength of a graph and the corresponding partition using successive contractions. The algorithm is based on the maximization of successive linear forms on the boundary of the polytope. We prove it is a polynomial algorithm in probability with average number of iterations in O(n5). Finally, numerical tests reveal that it should only require O(n2) iterations in practice.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Bulletin des Sciences Mathématiques - Volume 133, Issue 2, March 2009, Pages 169-185
Journal: Bulletin des Sciences Mathématiques - Volume 133, Issue 2, March 2009, Pages 169-185