An approximation algorithm for maximum P3-packing in subcubic graphs

Authors:
Adrian Kosowski;Michał Małafiejski;Paweł Zyliński
Affiliations:
Department of Algorithms and System Modeling, Gdańsk University of Technology, Poland;Department of Algorithms and System Modeling, Gdańsk University of Technology, Poland;Institute of Mathematics, University of Gdańsk, Poland
Venue:
Information Processing Letters
Year:
2006

Citing 8
Cited 1

On gallery watchmen in grids

Information Processing Letters
Generalized planar matching

Journal of Algorithms
An approximation algorithm for maximum packing of 3-edge paths

Information Processing Letters
Path factors in cubic graphs

Journal of Graph Theory
How many disjoint 2-edge paths must a cubic graph have?

Journal of Graph Theory
On packing 3-vertex paths in a graph

Journal of Graph Theory
Weakly cooperative guards in grids

ICCSA'05 Proceedings of the 2005 international conference on Computational Science and its Applications - Volume Part I
Parallel processing subsystems with redundancy in a distributed environment

PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics

Identifying path covers in graphs

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.89

Visualization

Abstract

We give a linear time 4/3-approximation algorithm for the problem of finding the maximum number of vertex-disjoint paths of order 3 in subcubic graphs without pendant vertices, which improves previously known results [K. Kawarabayashi, H. Matsuda, Y. Oda, K. Ota, Path factors in cubic graphs, Journal of Graph Theory 39 (2002) 188-193; A. Kelmans, D. Mubayi, How many disjoint 2-edge paths must a cubic graph have?, Journal of Graph Theory 45 (2004) 57-79].