A parameterized algorithm for packing overlapping subgraphs
From MaRDI portal
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40)
Recommendations
- Parameterized algorithms for the H-packing with t-overlap problem
- Arbitrary overlap constraints in graph packing problems
- Kernelization algorithms for packing problems allowing overlaps
- The \({\mathcal{G}}\)-packing with \(t\)-overlap problem
- Using parametric transformations toward polynomial kernels for packing problems allowing overlaps
Cited in
(11)- Explicit linear kernels for packing problems
- Top-\(k\) overlapping densest subgraphs: approximation algorithms and computational complexity
- Using parametric transformations toward polynomial kernels for packing problems allowing overlaps
- Algorithms on subgraph overlap graphs
- Parameterized algorithms for the H-packing with t-overlap problem
- Kernelization algorithms for packing problems allowing overlaps
- Kernelization of cycle packing with relaxed disjointness constraints
- Spanning Rigid Subgraph Packing and Sparse Subgraph Covering
- Arbitrary overlap constraints in graph packing problems
- The \({\mathcal{G}}\)-packing with \(t\)-overlap problem
- OCSM: finding overlapping cohesive subgraphs with minimum degree
This page was built for publication: A parameterized algorithm for packing overlapping subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4981171)
