Data Reduction for Domination in Graphs
暂无分享,去创建一个
[1] Rolf Niedermeier,et al. Refined Search Tree Technique for DOMINATING SET on Planar Graphs , 2001, MFCS.
[2] Rolf Niedermeier,et al. Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs , 2002, Algorithmica.
[3] Peter J. Slater,et al. Fundamentals of domination in graphs , 1998, Pure and applied mathematics.
[4] Rolf Niedermeier,et al. Experiments on data reduction for optimal domination in networks , 2006, Ann. Oper. Res..
[5] Rolf Niedermeier,et al. Invitation to Fixed-Parameter Algorithms , 2006 .
[6] Ge Xia,et al. Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size , 2005, SIAM J. Comput..
[7] Michael R. Fellows,et al. Parameterized Complexity , 1998 .
[8] Rolf Niedermeier,et al. Linear Problem Kernels for NP-Hard Problems on Planar Graphs , 2007, ICALP.
[9] S. Hedetniemi,et al. Domination in graphs : advanced topics , 1998 .
[10] Rolf Niedermeier,et al. Invitation to data reduction and problem kernelization , 2007, SIGA.
[11] Dimitrios M. Thilikos,et al. Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up , 2004, ICALP.
[12] Rolf Niedermeier,et al. Polynomial-time data reduction for dominating set , 2002, JACM.
[13] Brenda S. Baker,et al. Approximation algorithms for NP-complete problems on planar graphs , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[14] Jiong Guo,et al. Fixed-Parameter Tractability Results for Full-Degree Spanning Tree and Its Dual , 2006, IWPEC.
[15] Rolf Niedermeier,et al. A General Data Reduction Scheme for Domination in Graphs , 2006, SOFSEM.