Research on solution space of bipartite graph vertex-cover by maximum matchings
type: Item
instance of: scholarly article
title: Research on solution space of bipartite graph vertex-cover by maximum matchings
zbMATH Open document ID: 1456.82536
DOI: 10.1088/1742-5468/2015/11/P11027
author: Wei Wei
author: Yunjia Zhang
author: Ting Wang
author: Baifeng Li
author: Baolong Niu
author: Zhiming Zheng
published in: Journal of Statistical Mechanics: Theory and Experiment
publication date: 2020-08-11T00:00:00Z
full work available at URL: https://arxiv.org/abs/1505.06955
Mathematics Subject Classification ID: 82B44
Mathematics Subject Classification ID: 82B26
zbMATH DE Number: 7231652
MaRDI profile type: MaRDI publication profile
cites work: Reducibility among combinatorial problems
cites work: Q4198056
cites work: Graph theory with applications
cites work: Organization mechanism and counting algorithm on vertex-cover solutions
cites work: Threshold values of random K‐SAT from the cavity method
cites work: Two solutions to diluted \(p\)-spin models and XORSAT problems
cites work: Faster scaling algorithms for general graph matching problems
cites work: Q5519710
cites work: Phase Transitions in Combinatorial Optimization Problems
cites work: An optimal minimum spanning tree algorithm
cites work: The complexity of König subgraph problems and above-guarantee vertex cover
Recommended article: Organization mechanism and counting algorithm on vertex-cover solutions
Recommended article: Minimum covering algorithm on bipartite graph
Recommended article: Q4034791
Recommended article: Paths, flowers and vertex cover
Recommended article: A 0.821-ratio purely combinatorial algorithm for maximum \(k\)-vertex cover in bipartite graphs
description: scientific article; zbMATH DE number 7231652