The ${\mathcal{G}}$ -Packing with t-Overlap Problem
From MaRDI portal
Publication:5746251
DOI10.1007/978-3-319-04657-0_13zbMath1408.68080OpenAlexW154580602MaRDI QIDQ5746251
Jazmín Romero, Alejandro López-Ortiz
Publication date: 18 February 2014
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-04657-0_13
Analysis of algorithms and problem complexity (68Q25) Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82)
Related Items (3)
Kernelization of Cycle Packing with Relaxed Disjointness Constraints ⋮ Kernelization Algorithms for Packing Problems Allowing Overlaps ⋮ Explicit linear kernels for packing problems
This page was built for publication: The ${\mathcal{G}}$ -Packing with t-Overlap Problem
