On inclusionwise maximal and maximum cardinality k-clubs in graphs
From MaRDI portal
Publication:448967
Recommendations
Cites work
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- scientific article; zbMATH DE number 6118217 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1424314 (Why is no real title available?)
- A fast algorithm for the maximum clique problem
- A graph‐theoretic definition of a sociometric clique†
- A graph‐theoretic generalization of the clique concept
- An exact algorithm for the maximum \(k\)-club problem in an undirected graph
- An exact algorithm for the maximum clique problem
- Approximating maximum diameter-bounded subgraphs
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Clique-detection models in computational biochemistry and genomics
- Clustering and domination in perfect graphs
- Fixed-parameter tractability and completeness II: On completeness for W[1]
- Generalizations of Cliques, Odd Cycles and Anticycles and Their Relation to Independence System Polyhedra
- Heuristic and Special Case Algorithms for Dispersion Problems
- Heuristics for finding \(k\)-clubs in an undirected graph
- Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems
- Mining market data: a network approach
- New methods to color the vertices of a graph
- Node-and edge-deletion NP-complete problems
- Novel approaches for analyzing biological networks
- On approximating the maximum diameter ratio of graphs
- Optimal approximation of sparse hessians and its equivalence to a graph coloring problem
- Upper bounds and heuristics for the 2-club problem
Cited in
(32)- Correction to: ``Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts
- Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts
- Optimal approximation algorithms for maximum distance-bounded subgraph problems
- Graph signatures: identification and optimization
- Optimal approximation algorithms for maximum distance-bounded subgraph problems
- A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques
- The maximum \(l\)-triangle \(k\)-club problem: complexity, properties, and algorithms
- On computing large temporal (unilateral) connected components
- An analytical comparison of the LP relaxations of integer models for the \(k\)-club problem
- Finding disjoint dense clubs in a social network
- Finding conserved low-diameter subgraphs in social and biological networks
- On computing large temporal (unilateral) connected components
- Algorithms for the maximum \(k\)-club problem in graphs
- Finding Disjoint Dense Clubs in an Undirected Graph
- Finding clubs in graph classes
- On maximum ratio clique relaxations
- On Fault-Tolerant Low-Diameter Clusters in Graphs
- Exact algorithms for the minimum \(s\)-club partitioning problem
- Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments
- Finding clique clusters with the highest betweenness centrality
- Distance-based clique relaxations in networks: \(s\)-clique and \(s\)-club
- Detecting large risk-averse 2-clubs in graphs with random edge failures
- Cliques and clubs
- Integer models and upper bounds for the 3-club problem
- On the 2-club polytope of graphs
- Heuristics for finding \(k\)-clubs in an undirected graph
- Parsimonious formulations for low-diameter clusters
- On biconnected and fragile subgraphs of low diameter
- The triangle \(k\)-club problem
- Finding large \(k\)-clubs in undirected graphs
- Two-phase heuristics for the \(k\)-club problem
- Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights
This page was built for publication: On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q448967)
