Preface:
- Bartel -> Barthel
p. 33, algorithm, 3rd last line
"Q_i:=0"
->
"Q_n:=0"
p. 101, 2nd par.
"x_1 = x_2 = x_3 = x_4 = x_5 = 1"
->
"x_1 = x_2 = x_3 = x_4 = x_5 = 0"
p. 108, 1st par after Fig 6.15:[credits: Helmut Katzgraber]
"The resulting network does not contain the edge (5,4) since level(4)=
level(4). For the same reaon the edges (7,8) and (10,11) are not
included .... For the example graph vertices 2 and 5 are removed"
p. 109, last par.
"A vertex with e(i) is called overflowing"
->
"A vertex with e(i)>0 is called overflowing"
p. 111, 1st par (of example)
"\hat f(0,2)= 25", "e(2)=25"
->
"\hat f(0,1)= 25", "e(1)=25"
p. 111, 1st item
"\hat f(1,4)=5"
->
"\hat f(1,4)=10"
p. 172, after (8.3):
Grigorenkp
->
Grigorenko
p. 185, 1. setence of Sec. 9.1
An Intoructions
->
Introductions
p. 195, Eq. (9.8):
add J_{ij} at sigma_j
p. 196, Algorithm
It should be J_{ij}t_j
p. 207, 2nd paragraph, 1st sentence [credits: Helmut Katzgraber]
"while for theta_s <0 ..."
->
"while for theta_s <= 0 ..."
p. 220, 2nd last line [credits: Helmut Katzgraber]
P(|q) -> P(|q|)
p. 226, Ref. 89 [credits: Helmut Katzgraber]
should read "A. W. Sandvik, Europhys. Lett. 45 745 (1999)"
p. 260, Eq. (11.10)
"Delta > 0" -> "Delta E > 0"
p. 274, Fig 12.1
Vertex 1 and 2 are covered
->
Vertices 1 and 2 are covered
+
by also covering also vertices
->
by also covering vertices
p 275, 2. par of example
"Assume that vertex 4 is not covered"
->
"Assume that vertex 3 is not covered"
+
"the second end vertices have to be covered"
->
"the neighbors have to be covered"