Covering a Graph with Clubs
From MaRDI portal
Publication:5377354
DOI10.7155/jgaa.00491zbMath1411.05216OpenAlexW2937274722MaRDI QIDQ5377354
Giancarlo Mauri, Italo Zoppis, Riccardo Dondi, Florian Sikora
Publication date: 24 May 2019
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7155/jgaa.00491
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12)
Related Items (7)
On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering ⋮ Covering a graph with densest subgraphs ⋮ On 2-clubs in graph-based data clustering: theory and algorithm engineering ⋮ Dense Subgraphs in Biological Networks ⋮ Top-\(k\) overlapping densest subgraphs: approximation algorithms and computational complexity ⋮ Hardness and tractability of the \(\gamma\)\textsf{-Complete Subgraph} problem ⋮ On the tractability of covering a graph with 2-clubs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding clubs in graph classes
- Finding large \(k\)-clubs in undirected graphs
- Minimum clique partition in unit disk graphs
- Partition into cliques for cubic graphs: Planar case, complexity and approximation
- Approximation algorithms for combinatorial problems
- Some simplified NP-complete graph problems
- An exact algorithm for the maximum \(k\)-club problem in an undirected graph
- Optimal approximation algorithms for maximum distance-bounded subgraph problems
- Covering with clubs: complexity and approximability
- Multivariate algorithmics for finding cohesive subnetworks
- Parameterized computational complexity of finding small-diameter subgraphs
- An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems
- A weakly robust PTAS for minimum clique partition in unit disk graphs
- Novel approaches for analyzing biological networks
- Total Domination in Graphs with Diameter 2
- A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation
- A graph‐theoretic definition of a sociometric clique†
- Reducibility among Combinatorial Problems
- Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs
This page was built for publication: Covering a Graph with Clubs
