A Parameterized Algorithm for Packing Overlapping Subgraphs

DOI10.1007/978-3-319-06686-8_25zbMath1407.68372OpenAlexW943098930MaRDI QIDQ4981171

Jazmń Romero, Alejandro López-Ortiz

Publication date: 24 June 2014

Published in: Computer Science - Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-06686-8_25

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Small world graphs, complex networks (graph-theoretic aspects) (05C82) 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) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (4)

Kernelization of Cycle Packing with Relaxed Disjointness Constraints ⋮ Kernelization Algorithms for Packing Problems Allowing Overlaps ⋮ Explicit linear kernels for packing problems ⋮ Using Parametric Transformations Toward Polynomial Kernels for Packing Problems Allowing Overlaps

This page was built for publication: A Parameterized Algorithm for Packing Overlapping Subgraphs