... mˆo
.
t chu tr`ınh Euler trong G
, chˇa
˙’
ng ha
.
n
{6, 2, 3, 7, 2, 7, 1, 7, 4, 5, 1, 6}
l`a chu tr`ınh c´o d¯ˆo
.
d`ai 31 + 7 = 38 l`a nghiˆe
.
m tˆo
´
i u
.
u cˆa
`
n t`ım.
5.3 B`ai to´an ... minh du
.
.
a trˆen
phu
.
o
.
ng ph´ap (khˆong kiˆe
´
n thiˆe
´
t) cu
˙’
a Bondy v`a Thmassen (1 977 ). Tru
.
´o
.
c hˆe
´
t, ch´ung ta cˆa
`
n
mˆo
.
t sˆo
´
kh´ai niˆe
.
m.
Gia
˙’
su
.
˙’
S ⊂...
... trees efficiently, Proc.
of the Ann. Conf. of ACM, Boston, 518 (1 972 ).
[ 37] Kirchhoff G., in “Annalen der Physik and Chemie” 72 , 4 97 (18 47) .
[38] Klein M., A primal method for minimal cost flows with ... tree, Comm. of ACM, 15,
273 (1 972 ).
[42] Las Vergnas M., Probl`emes de couplage et probl`emes hamiltoniens en th´eorie des
graphes, Doctoral thesis, Univsit´e de Paris VI (1 972 ).
[4...
... cu
˙’
a Ford v`a Fulkerson [ 27] gia
˙’
i b`ai to´an n`ay du
.
.
a trˆen D
-
i
.
nh l´y
7. 2.10. Tru
.
´o
.
c hˆe
´
t ta c´o mˆo
.
t sˆo
´
kh´ai niˆe
.
m
177
196
D
-
i
.
nh l´y 7. 4.2 F l`a luˆo
`
ng gi´a ... +
j∈V,j=s,t
(
i∈V
f
ij
−
i∈V
f
ji
)
=
i∈V
f
it
−
i∈V
f
si
do f
ti
= 0 = f
is
v´o
.
i mo
.
i v
i
∈ V, v`a (7. 1).
D
-
i
.
nh ngh˜ıa 7. 2 .7 Gia
˙’
su
.
˙’
F l`a luˆo
`
ng...
... Mˆo
.
t v´ı du
.
vˆe
`
d¯ˆo
`
thi
.
Euler.
v
5
, e
16
, v
3
, e
17
, v
7
, e
10
, v
6
, e
9
, v
8
, e
8
, v
7
, e
5
, v
1
, e
7
, v
8
, e
6
, v
1
).
Mˆo
.
t dˆay chuyˆe
`
n hay chu tr`ınh Euler ... tr`ınh Euler?
Nh`a to´an ho
.
c L. Euler ( 170 7- 178 3) l`a ngu
.
`o
.
i d¯ˆa
`
u tiˆen d¯˜a ch´u
.
ng minh b`ai to´an khˆong
c´o l`o
.
i gia
˙’
i (nˇam 173 6, xem [22], [23]), v`a v`ı vˆa...
... d¯ˆe
´
n v
i
∗
thuˆo
.
c S
1
v`a
do d¯´o L(v
i
∗
) l`a d¯ˆo
.
d`ai cu
˙’
a d¯u
.
`o
.
ng d¯i n`ay.
79
74
void Ford_Moore_Bellman(byte Start)
{
byte i, k, Terminal;
AdjPointer Tempt1, Tempt2;
Path ... d¯u
.
o
.
.
c d¯i
.
nh hu
.
´o
.
ng.
1
Kh´ai niˆe
.
m n`ay s˜e d¯u
.
o
.
.
c tr`ınh b`ay trong ??.
77
Cu
.
.
c tiˆe
˙’
u ho´a h`am Boole
Mˆo
.
t phˆa
`
n quan tro
.
ng trong viˆe
.
c thiˆe
´...