Clustering integrated fusion model based on the maximum matching problem
From MaRDI portal
Publication:6586594
DOI10.61091/jcmcc120-21zbMATH Open1545.05183MaRDI QIDQ6586594FDOQ6586594
Publication date: 13 August 2024
Published in: JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)
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)
