The Linear Arrangement Problem Parameterized Above Guaranteed Value
暂无分享,去创建一个
[1] Marco Cesati,et al. Compendium of Parameterized Problems , 2006 .
[2] Yossi Shiloach,et al. A Minimum Linear Arrangement Algorithm for Undirected Trees , 1979, SIAM J. Comput..
[3] L. H. Harper. Optimal Assignments of Numbers to Vertices , 1964 .
[4] Henning Fernau,et al. 2 Contents , 1996 .
[5] Reinhard Diestel,et al. Graph Theory , 1997 .
[6] Henning Fernau. Parameterized algorithmics for linear arrangement problems , 2008, Discret. Appl. Math..
[7] Robert E. Tarjan,et al. Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..
[8] Jörg Flum,et al. Describing parameterized complexity classes , 2003, Inf. Comput..
[9] Michael R. Fellows,et al. Parameterized Complexity , 1998 .
[10] Meena Mahajan,et al. Parametrizing Above Guaranteed Values: MaxSat and MaxCut , 1997, Electron. Colloquium Comput. Complex..
[11] Jörg Flum,et al. Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.
[12] Fan Chung,et al. On optimal linear arrangements of trees , 1984 .
[13] Maria J. Serna,et al. Parameterized Complexity for Graph Layout Problems , 2005, Bull. EATCS.
[14] Michael R. Fellows,et al. FPT is P-Time Extremal Structure I , 2005, ACiD.
[15] David S. Johnson,et al. Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..
[16] Rolf Niedermeier,et al. Invitation to Fixed-Parameter Algorithms , 2006 .