Optimization problems for the maximum k-plex
From MaRDI portal
Publication:2103796
DOI10.1007/S10559-022-00488-5OpenAlexW4306690291MaRDI QIDQ2103796FDOQ2103796
Authors: Yanyan Li 
Publication date: 9 December 2022
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-022-00488-5
Recommendations
- Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes
- Clique relaxations in social network analysis: the maximum \(k\)-plex problem
- Exact Solution of the Quadratic Knapsack Problem
- An exact algorithm for the maximum \(k\)-club problem in an undirected graph
- A GPU based local search algorithm for the unweighted and weighted maximum \(s\)-plex problems
maximum cliquequadratic optimization problemBoolean linear programming problemLagrangian dual boundmaximum \(k\)-plexsuperfluous constraint
Cites Work
- On the maximum quasi-clique problem
- Clique relaxations in social network analysis: the maximum \(k\)-plex problem
- A graph‐theoretic generalization of the clique concept
- Nondifferentiable optimization and polynomial problems
- Combinatorial algorithms for the maximum \(k\)-plex problem
- New quadratic models for the maximum weighted cut problem
- Functionally redundant constraints for Boolean quadratic-type optimization problems
- A more relaxed model for graph-based data clustering: \(s\)-plex cluster editing
Cited In (4)
Uses Software
This page was built for publication: Optimization problems for the maximum \(k\)-plex
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2103796)
