An optimal parallel solution for the path cover problem on \(P_{4}\)-sparse graphs
From MaRDI portal
Publication:868040
DOI10.1016/j.jpdc.2006.08.011zbMath1109.68131OpenAlexW2120459220MaRDI QIDQ868040
Katerina Asdre, Stavros D. Nikolopoulos, Charis Papadopoulos
Publication date: 19 February 2007
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jpdc.2006.08.011
Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)
Related Items
Faster Computation of the Maximum Dissociation Set and Minimum 3-Path Vertex Cover in Graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A \(5k\)-vertex kernel for 3-path vertex cover ⋮ The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs ⋮ Kernelization and Parameterized Algorithms for 3-Path Vertex Cover ⋮ Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems
