An efficient matching algorithm applied in statistical physics

DOI10.1016/0166-218X(94)90078-7zbMath0807.90136MaRDI QIDQ1331902

A. Metz, Jürgen Bendisch, Ulrich Derigs

Publication date: 1 March 1995

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

ferromagnetismmatching algorithmparamagnetismnonbipartite graphs

Mathematics Subject Classification ID

Applications of graph theory (05C90) Applications of mathematical programming (90C90) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Dynamics of disordered systems (random Ising systems, etc.) in time-dependent statistical mechanics (82C44) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Solving (large scale) matching problems combinatorially
• On the use of optimal fractional matchings for solving the (integer) matching problem
• Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
• On the ground-state threshold in random two-dimensional Ising \(\pm J\) models
• Solving large-scale matching problems efficiently: A new primal matching approach
• A shortest augmenting path method for solving minimal perfect matching problems
• Maximum matching and a polyhedron with 0,1-vertices

This page was built for publication: An efficient matching algorithm applied in statistical physics