کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6872251 | 681647 | 2014 | 20 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Digraph width measures in parameterized algorithmics
ترجمه فارسی عنوان
ابعاد عرض دیجیتال در الگوریتم های پارامتریک
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
چکیده انگلیسی
In contrast to undirected width measures such as tree-width, which have provided many important algorithmic applications, analogous measures for digraphs such as directed tree-width or DAG-width do not seem so successful. Several recent papers have given some evidence on the negative side. We confirm and consolidate this overall picture by thoroughly and exhaustively studying the complexity of a range of directed problems with respect to various parameters, and by showing that they often remain NP-hard even on graph classes that are restricted very beyond having small DAG-width. On the positive side, it turns out that clique-width (of digraphs) performs much better on virtually all considered problems, from the parameterized complexity point of view.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Applied Mathematics - Volume 168, 11 May 2014, Pages 88-107
Journal: Discrete Applied Mathematics - Volume 168, 11 May 2014, Pages 88-107
نویسندگان
Robert Ganian, Petr HlinÄný, Joachim Kneis, Alexander Langer, Jan Obdržálek, Peter Rossmanith,