Optimal cuts in graphs and statistical mechanics
type: Item
instance of: scholarly article
title: Optimal cuts in graphs and statistical mechanics
zbMATH Open document ID: 1185.82005
DOI: 10.1016/S0895-7177(97)00195-7
author: András Sebö
author: J. C. Anglès d'Auriac
author: Myriam Preissmann
published in: Mathematical and Computer Modelling
publication date: 2010-05-02T00:00:00Z
Mathematics Subject Classification ID: 82B03
Mathematics Subject Classification ID: 05C90
Mathematics Subject Classification ID: 82-02
zbMATH DE Number: 5703277
MaRDI profile type: Publication
cites work: Beitrag zur Theorie des Ferromagnetismus
cites work: Q4237477
cites work: Q4198056
cites work: Q4142699
cites work: Some simplified NP-complete graph problems
cites work: Node-and edge-deletion NP-complete problems
cites work: Finding a Maximum Cut of a Planar Graph in Polynomial Time
cites work: Q5659589
cites work: The max-cut problem on graphs not contractible to \(K_ 5\)
cites work: Weakly bipartite graphs and the max-cut problem
cites work: Maximal Flow Through a Network
cites work: Q3056948
cites work: Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
cites work: Q3140397
cites work: Q4035360
cites work: A Polynomial Algorithm for the k-cut Problem for Fixed k
cites work: The Complexity of Multiterminal Cuts
cites work: Optimization by Simulated Annealing
cites work: A new approach to the maximum-flow problem
cites work: On the structure of all minimum cuts in a network and applications
cites work: Counting almost minimum cutsets with reliability applications
cites work: Q3678943
cites work: Calculating bounds on reachability and connectedness in stochastic networks
cites work: Matching theory
cites work: Maximum matching and a polyhedron with 0,1-vertices
cites work: On some weakly bipartite graphs
cites work: Methods of Nonlinear 0-1 Programming
cites work: Glassy behaviour in the ferromagnetic Ising model on a Cayley tree
cites work: Q3803160
cites work: Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on Trees
full work available at URL: s0895-7177(97)00195-7
OpenAlex ID: W2162224116
description: scientific article; zbMATH DE number 5703277