Graphical representation and hierarchical decomposition mechanism for vertex-cover solution space
From MaRDI portal
Publication:6096395
DOI10.1016/j.amc.2023.128264arXiv1912.08559OpenAlexW3198096714MaRDI QIDQ6096395
Publication date: 12 September 2023
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.08559
Cites Work
- Two solutions to diluted \(p\)-spin models and XORSAT problems
- Research on solution space of bipartite graph vertex-cover by maximum matchings
- Core influence mechanism on vertex-cover problem through leaf-removal-core breaking
- Statistical and algebraic analysis of a family of random Boolean equations
- Paths, Trees, and Flowers
- Threshold values of random K‐SAT from the cavity method
- The elements of statistical learning. Data mining, inference, and prediction
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Graphical representation and hierarchical decomposition mechanism for vertex-cover solution space