Parallel Processing and Applied Mathematics
From MaRDI portal
Publication:5899148
DOI10.1007/11752578zbMath1182.68017OpenAlexW4300925407MaRDI QIDQ5899148
Adrian Kosowski, Michał Małafiejski, Paweł Żyliński
Publication date: 2 May 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11752578
Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Approximation algorithms (68W25) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (6)
An approximation algorithm for maximum \(P_{3}\)-packing in subcubic graphs ⋮ Packing 2- and 3-stars into cubic graphs ⋮ The maximum 4-vertex-path packing of a cubic graph covers at least two-thirds of its vertices ⋮ On the parameterized complexity of vertex cover and edge cover with connectivity constraints ⋮ On maximum \(P_3\)-packing in claw-free subcubic graphs ⋮ Disjoint dominating and 2-dominating sets in graphs
This page was built for publication: Parallel Processing and Applied Mathematics
