Optimal cuts in graphs and statistical mechanics

DOI10.1016/S0895-7177(97)00195-7zbMath1185.82005OpenAlexW2162224116MaRDI QIDQ967941

András Sebő, J.-Ch. Anglès D'Auriac, Myriam Preissmann

Publication date: 2 May 2010

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0895-7177(97)00195-7

Mathematics Subject Classification ID

Applications of graph theory (05C90) Research exposition (monographs, survey articles) pertaining to statistical mechanics (82-02) Foundations of equilibrium statistical mechanics (82B03)

Related Items

Network bipartitioning in the anti-communicability Euclidean space ⋮ Complexity and Polynomially Solvable Special Cases of QUBO ⋮ On the dynamics of the glass transition on Bethe lattices ⋮ Dynamics of Ising models near zero temperature: real-space renormalization approach ⋮ Dynamical barriers for the random ferromagnetic Ising model on the Cayley tree: traveling-wave solution of the real space renormalization flow ⋮ The scaling of the minimum sum of edge lengths in uniformly random trees ⋮ The hypermetric cone and polytope on eight vertices and some generalizations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• The max-cut problem on graphs not contractible to \(K_ 5\)
• On some weakly bipartite graphs
• Matching theory
• Weakly bipartite graphs and the max-cut problem
• Some simplified NP-complete graph problems
• Maximal Flow Through a Network
• Calculating bounds on reachability and connectedness in stochastic networks
• Counting almost minimum cutsets with reliability applications
• A new approach to the maximum-flow problem
• Methods of Nonlinear 0-1 Programming
• On the structure of all minimum cuts in a network and applications
• Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on Trees
• Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
• Finding a Maximum Cut of a Planar Graph in Polynomial Time
• A Polynomial Algorithm for the k-cut Problem for Fixed k
• The Complexity of Multiterminal Cuts
• Glassy behaviour in the ferromagnetic Ising model on a Cayley tree
• Beitrag zur Theorie des Ferromagnetismus
• Node-and edge-deletion NP-complete problems
• Maximum matching and a polyhedron with 0,1-vertices