کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4651936 1632582 2015 8 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
On Minimum Bisection and Related Partition Problems in Graphs with Bounded Tree Width
ترجمه فارسی عنوان
در حداقل اختلاط و مسائل مربوط به پارتیشن بندی در نمودار ها با عرض درخت محدود
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات گسسته و ترکیبات
چکیده انگلیسی

Minimum Bisection denotes the NP-hard problem to partition the vertex set of a graph into two sets of equal sizes while minimizing the number of edges between these two sets. We consider this problem in bounded degree graphs with a given tree decomposition (T,X) and prove an upper bound for their minimum bisection width in terms of the structure and width of (T,X). When (T,X) is provided as input, a bisection satisfying our bound can be computed in time proportional to the encoding length of (T,X). Furthermore, our result can be generalized to k-section, which is known to be APX-hard even when restricted to trees with bounded degree.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Electronic Notes in Discrete Mathematics - Volume 49, November 2015, Pages 481-488