کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1143399 | 957199 | 2009 | 5 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A superclass of Edge-Path-Tree graphs with few cliques
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A superclass of Edge-Path-Tree graphs with few cliques A superclass of Edge-Path-Tree graphs with few cliques](/preview/png/1143399.png)
چکیده انگلیسی
Edge-Path-Tree (EPT) graphs are intersection graphs of EPT matrices that is matrices whose columns are incidence vectors of edge-sets of paths in a given tree. EPT graphs have polynomially many cliques [M.C. Golumbic, R.E. Jamison, The edge intersection graphs of paths in a tree, Journal of Combinational Theory Series B 38 (1985) 8-22; C.L. Monma, V.K. Wey, Intersection graphs of paths in a tree, Journal of Combinational Theory Series B 41 (1986) 141-181]. Therefore, the problem of finding a clique of maximum weight in these graphs is solvable in strongly polynomial time. We extend this result to a proper superclass of EPT graphs.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Operations Research Letters - Volume 37, Issue 5, September 2009, Pages 351-355
Journal: Operations Research Letters - Volume 37, Issue 5, September 2009, Pages 351-355
نویسندگان
Nicola Apollonio, Massimiliano Caramia,