Parameterized Algorithms for the H-Packing with t-Overlap Problem

DOI10.7155/JGAA.00335zbMath1305.05193OpenAlexW1980336870MaRDI QIDQ2938748

Jazmín Romero, Alejandro López-Ortiz

Publication date: 15 January 2015

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00335

zbMATH Keywords

\(k\)-\(H\)-packing

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Arbitrary Overlap Constraints in Graph Packing Problems

This page was built for publication: Parameterized Algorithms for the H-Packing with t-Overlap Problem