Abstract
We study (vertex-disjoint) packings of paths of length two (i.e., of P 2's) in graphs under a parameterized perspective. Starting from a maximal P 2-packing of size j we use extremal combinatorial arguments for determining how many vertices of appear in some P 2-packing of size (j∈+∈1) (if it exists). We prove that one can 'reuse' 2.5j vertices. Based on a WIN-WIN approach, we build an algorithm which decides if a P 2-packing of size at least k exists in a given graph in time *(2.4823k). © Springer-Verlag Berlin Heidelberg 2008.
Cite
CITATION STYLE
Fernau, H., & Raible, D. (2008). A parameterized perspective on packing paths of length two. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5165 LNCS, pp. 54–63). https://doi.org/10.1007/978-3-540-85097-7_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
