A local algorithm and its percolation analysis of bipartite z-matching problem

DOI10.1088/1742-5468/acd105arXiv1812.03442MaRDI QIDQ6058939

Jin-Hua Zhao

Publication date: 1 November 2023

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

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

zbMATH Keywords

combinatorial optimizationrandom graphspercolation theorylocal algorithms

Mathematics Subject Classification ID

Statistical mechanics, structure of matter (82-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Networks beyond pairwise interactions: structure and dynamics
• Statistical mechanics of the minimum dominating set problem
• Matching theory
• Two solutions to diluted \(p\)-spin models and XORSAT problems
• Emergence of Scaling in Random Networks
• The Directed Dominating Set Problem: Generalized Leaf Removal and Belief Propagation
• Information, Physics, and Computation
• Factor graphs and the sum-product algorithm
• Networks
• Statistical Physics of Spin Glasses and Information Processing
• Handbook of Combinatorial Optimization
• Two faces of greedy leaf removal procedure on graphs
• The number of matchings in random graphs
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

This page was built for publication: A local algorithm and its percolation analysis of bipartite z-matching problem