Organization mechanism and counting algorithm on vertex-cover solutions

DOI10.1088/1742-5468/2015/04/P04002zbMath1456.82388arXiv1403.4010OpenAlexW3103315464MaRDI QIDQ3302224

Renquan Zhang, Wei Wei, Baolong Niu, Bing-Hui Guo, 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/1403.4010

Mathematics Subject Classification ID

Phase transitions (general) in equilibrium statistical mechanics (82B26)

Related Items (1)

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

Cites Work

• Unnamed Item
• The complexity of computing the permanent
• The complexity of counting colourings and independent sets in sparse graphs and hypergraphs
• Complexity of generalized satisfiability counting problems
• Random Formulas Have Frozen Variables
• Gibbs states and the set of solutions of random constraint satisfaction problems
• The complexity of the counting constraint satisfaction problem
• Threshold values of random K‐SAT from the cavity method
• The complexity of theorem-proving procedures
• Explosive Percolation in Random Networks
• Statistical mechanics methods and phase transitions in optimization problems

This page was built for publication: Organization mechanism and counting algorithm on vertex-cover solutions