Finding a maximum k-club using the k-clique formulation and canonical hypercube cuts
From MaRDI portal
Publication:1634801
DOI10.1007/S11590-015-0971-7zbMATH Open1414.90349OpenAlexW2180772693MaRDI QIDQ1634801FDOQ1634801
Authors: Esmaeel Moradi, B. Balasundaram 
Publication date: 18 December 2018
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-015-0971-7
Recommendations
Cites Work
- Canonical Cuts on the Unit Hypercube
- Novel approaches for analyzing biological networks
- Node-and edge-deletion NP-complete problems
- Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems
- An exact algorithm for the maximum \(k\)-club problem in an undirected graph
- Heuristics for finding \(k\)-clubs in an undirected graph
- An analytical comparison of the LP relaxations of integer models for the \(k\)-club problem
- Algorithms for the maximum \(k\)-club problem in graphs
- On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs
- Integer models and upper bounds for the 3-club problem
- Upper bounds and heuristics for the 2-club problem
- Clique relaxation models in social network analysis
- On finding \(k\)-cliques in \(k\)-partite graphs
- Parameterized computational complexity of finding small-diameter subgraphs
- A graph‐theoretic definition of a sociometric clique†
- Distance-based clique relaxations in networks: \(s\)-clique and \(s\)-club
- On the 2-club polytope of graphs
- On provably best construction heuristics for hard combinatorial optimization problems
Cited In (17)
- Parsimonious formulations for low-diameter clusters
- On the maximum small-world subgraph problem
- The triangle \(k\)-club problem
- On biconnected and fragile subgraphs of low diameter
- Graph signatures: identification and optimization
- Exact algorithms for the minimum \(s\)-club partitioning problem
- Correction to: ``Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts
- Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems
- The maximum \(l\)-triangle \(k\)-club problem: complexity, properties, and algorithms
- On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs
- LP-based dual bounds for the maximum quasi-clique problem
- Upper bounds and heuristics for the 2-club problem
- Finding large \(k\)-clubs in undirected graphs
- On finding the community with maximum persistence probability
- Finding conserved low-diameter subgraphs in social and biological networks
- On Fault-Tolerant Low-Diameter Clusters in Graphs
- Heuristics for finding \(k\)-clubs in an undirected graph
Uses Software
This page was built for publication: Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1634801)
