Clustering integrated fusion model based on the maximum matching problem
From MaRDI portal
Publication:6586594
DOI10.61091/jcmcc120-21zbMATH Open1545.05183MaRDI QIDQ6586594FDOQ6586594
Authors: Huiling Li 
Publication date: 13 August 2024
Published in: JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)
Recommendations
- Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem
- New lower bound on the modularity of Johnson graphs
- A literature review on correlation clustering: cross-disciplinary taxonomy with bibliometric analysis
- Multiple graphs clustering by gradient flow method
- Cluster analysis using triangulation
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Regularized ensemble Kalman methods for inverse problems
- Optimal transport driven CycleGAN for unsupervised learning in inverse problems
- Title not available (Why is that?)
- Inverse Mixed Integer Optimization: Polyhedral Insights and Trust Region Methods
- Planar graph perfect matching is in NC
- On learned operator correction in inverse problems
This page was built for publication: Clustering integrated fusion model based on the maximum matching problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6586594)
