Fixed-parameter tractability results for full-degree spanning tree and its dual

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

Volumn 4169 LNCS, Issue , 2006, Pages 203-214

  Guo, Jiong ^a   Niedermeier, Rolf ^a   Wernicke, Sebastian ^a  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; PARAMETER ESTIMATION; PROBLEM SOLVING; SET THEORY;

DEGREE SPANNING TREE; PLANAR GRAPHS; SUBEXPONENTIAL TIME ALGORITHMS;

TREES (MATHEMATICS);

EID: 33750276912     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11847250_19     Document Type: Conference Paper

References (17)

1. J. Alber, M. R. Fellows, and R. Niedermeier. Polynomial-time data reduction for Dominating Set. Journal of the ACM, 51:363-384, 2004.
2. S. Arnborg, J. Lagergren, and D. Seese. Easy problems for tree-decomposable graphs. Journal of Algorithms, 12:308-340, 1991.
3. R. Bhatia, S. Khuller, R. Pless, and Y. Sussmann. The full degree spanning tree problem. Networks, 36:203-209, 2000.
4. H. J. Broersma, A. Huck, T. Kloks, O. Koppius, D. Kratsch, H. Müller, and H. Tuinstra. Degree-preserving trees. Networks, 35:26-39, 2000.
5. J. Chen, H. Fernau, I. A. Kanj, and G. Xia. Parametric duality and kernelization: Lower bounds and upper bounds on kernel size. In Proc. of 22nd STAGS, volume 3404 of LNCS, pages 269-280. Springer, 2005.
6. F. K. H. A. Dehne, M. R. Fellows, H. Fernau, E. Prieto, and F. A. Rosamond. Nonblocker: Parameterized algorithmics for minimum dominating set. In Proc. of 32nd SOFSEM, volume 3831 of LNCS, pages 237-245. Springer, 2006.
7. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer-Verlag, Berlin, 1999.
8. V. Estivill-Castro, M. R. Fellows, M. A. Langston, and F. A. Rosamond. FPT is P-time extremal structure I. In Proc. 1st ACiD, pages 1-41, 2005.
9. M. R. Fellows, C. McCartin, F. A. Rosamond, and U. Stege. Coordinatized kernels and catalytic reductions: An improved FPT algorithm for Max Leaf Spanning Tree and other problems. In Proc. of 20th FSTTCS, volume 1974 of LNCS, pages 240-251. Springer, 2000.
10. J. Flum and M. Grohe. Parameterized Complexity Theory. Springer-Verlag, 2006.
11. F. V. Fomin and D. M. Thilikos. Fast parameterized algorithms for graphs on surfaces: Linear kernel and exponential speed-up. In Proc. 31st ICALP, volume 3142 of LNCS, pages 581-592. Springer, 2004.
12. S. Khuller, R. Bhatia, and R. Pless. On local search and placement of meters in networks. SIAM Journal on Computing, 32(2):470-487, 2003.
13. M. Lewinter. Interpolation theorem for the number of degree-preserving vertices of spanning trees. IEEE Transactions on Circuits Systems I: Fundamental Theory and Applications, 34(2):205-205, 1987.
14. R. Niedermeier. Invitation to Fixed-Parameter Algorithms. Oxford University Press, 2006.
15. L. E. Ormsbee. Implicit network calibration. Journal of Water Resources Planning Management, 115:243-257, 1989.
16. L. E. Ormsbee and D. J. Wood. Explicit pipe network calibration. Journal of Water Resources Planning Management, 112:116-182, 1986.
17. P. D. Seymour and R. Thomas. Call routing and the ratcatcher. Combinatorica, 14(2):217-241, 1994.