Research on solution space of bipartite graph vertex-cover by maximum matchings

DOI10.1088/1742-5468/2015/11/P11027zbMath1456.82536arXiv1505.06955MaRDI QIDQ3302166

Wei Wei, Baolong Niu, Ting Wang, Baifeng Li, Yunjia Zhang, Zhi Ming Zheng

Publication date: 11 August 2020

Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1505.06955

Mathematics Subject Classification ID

Disordered systems (random Ising models, random Schrödinger operators, etc.) in equilibrium statistical mechanics (82B44) Phase transitions (general) in equilibrium statistical mechanics (82B26)

Related Items (1)

Graphical representation and hierarchical decomposition mechanism for vertex-cover solution space

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of König subgraph problems and above-guarantee vertex cover
• Two solutions to diluted \(p\)-spin models and XORSAT problems
• An optimal minimum spanning tree algorithm
• Organization mechanism and counting algorithm on vertex-cover solutions
• Faster scaling algorithms for general graph matching problems
• Reducibility among Combinatorial Problems
• Phase Transitions in Combinatorial Optimization Problems
• Threshold values of random K‐SAT from the cavity method

This page was built for publication: Research on solution space of bipartite graph vertex-cover by maximum matchings