A general data reduction scheme for domination in graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3831 LNCS, Issue , 2006, Pages 137-147

  Alber, Jochen ^a   Dorn, Britta ^b   Niedermeier, Rolf ^c  

^a Power System Applications and Consulting   (Germany)

^b UNIVERSITY OF TÜBINGEN   (Germany)

^c Institut für Informatik   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; LINEAR SYSTEMS; OPTIMIZATION; PROBLEM SOLVING; PROGRAM PROCESSORS; SET THEORY;

COMPLEXITY ANALYSIS; LINEAR-SIZE PROBLEM KERNEL; OPTIMAL DOMINATING SETS; POLYNOMIAL-LIME PREPROCESSING;

DATA REDUCTION;

EID: 33745640909     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11611257_11     Document Type: Conference Paper

References (7)

1. Aarts, E., and Lenstra, J.K., (eds): Local Search in Combinatorial Optimization. Wiley-Interscience Series in Discrete Mathematics and Optimization (1997)
2. Alber, J., Betzler, N., and Niedermeier, R.: Experiments on Data Reduction for Optimal Domination in Networks. To appear, Annals of Operations Research (2005)
3. Alber, J., Fellows, M.R., and Niedermeier, R.: Polynomial Time Data Reduction for Dominating Set. Journal of the ACM 51 3 (2004) 363-384
4. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V. Marchetti-Spaccamela, A., and Protasi, M.: Complexity and Approximation. Springer-Verlag (1999)
5. Chen, J., Fernau, H., Kanj, I.A., and Xia, G.: Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size, In Proc. 22d STACS, LNCS, Springer 3404 (2005) 269-280
6. Dorn, B.; Extended Data Reduction Rules for Domination in Graphs (in German). Student Project, WSI für Informatik, Universität Tübingen, Germany (2004)
7. Fomin, P.V., and Thilikos, D.M: Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-up. In Proc. 31st ICALP, LNCS, Springer, 3142 (2004) 581-592