Arbitrary Overlap Constraints in Graph Packing Problems

DOI10.1142/S0129054118500053zbMath1390.05190arXiv1601.03676OpenAlexW2963870581WikidataQ130107923 ScholiaQ130107923MaRDI QIDQ4639933

Jazmín Romero, Cynthia B. Perez, Alejandro López-Ortiz

Publication date: 14 May 2018

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1601.03676

zbMATH Keywords

set packinggraph packingfixed-parameter algorithmoverlapping communities

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Graph minors. XX: Wagner's conjecture
• An improved kernelization algorithm for \(r\)-set packing
• Looking at the stars
• On the complexity of submap isomorphism and maximum common submap problems
• Packing paths: recycling saves time
• Using Parametric Transformations Toward Polynomial Kernels for Packing Problems Allowing Overlaps
• Defining and Discovering Communities in Social Networks
• Parameterized Algorithms for the H-Packing with t-Overlap Problem
• A Problem Kernelization for Graph Packing
• A classification for community discovery methods in complex networks
• Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels
• Overlapping community detection in networks
• Clustering Social Networks
• Graph-Theoretic Concepts in Computer Science

This page was built for publication: Arbitrary Overlap Constraints in Graph Packing Problems