On the tractability of covering a graph with 2-clubs
From MaRDI portal
Publication:5925691
DOI10.1007/s00453-022-01062-3OpenAlexW4309783453MaRDI QIDQ5925691
Publication date: 11 April 2023
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-022-01062-3
Uses Software
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
- On the parameterized complexity of multiple-interval graph problems
- Non deterministic polynomial optimization problems and their approximations
- Some simplified NP-complete graph problems
- Treewidth. Computations and approximations
- An exact algorithm for the maximum \(k\)-club problem in an undirected graph
- Optimal approximation algorithms for maximum distance-bounded subgraph problems
- Multivariate algorithmics for finding cohesive subnetworks
- Parameterized computational complexity of finding small-diameter subgraphs
- Algorithms and complexity of \(s\)-club cluster vertex deletion
- An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems
- On the tractability of finding disjoint clubs in a network
- A weakly robust PTAS for minimum clique partition in unit disk graphs
- Novel approaches for analyzing biological networks
- Clustering of microarray data via clique partitioning
- Finding disjoint dense clubs in a social network
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- On 2-clubs in graph-based data clustering: theory and algorithm engineering
- On Editing Graphs into 2-Club Clusters
- A More Relaxed Model for Graph-Based Data Clustering: s-Plex Cluster Editing
- 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†
- On the hardness of approximating minimization problems
- Reducibility among Combinatorial Problems
- Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs
- Covering a Graph with Clubs
- Data reduction and exact algorithms for clique cover
- On the tractability of covering a graph with 2-clubs
This page was built for publication: On the tractability of covering a graph with 2-clubs
