Conception et analyse d`algorithmes I. De la di culté de trouver des

G X A
S⊂X AS={{u, v} ∈
A|u∈S, v ∈S}S e(S) = |AS| − |S|
G k > 0S
−k G
S
k AS=∅G
k
u v
G u v G
X
k > 0
U⊂X
U U
k

t
(G)G
S
G S
x0
G x0
x0
x0
x x y
{x, y}y
n
m
G
k G k
G k

{1, . . . , n}
j djPj⊂ {1, . . . , n}
αjj t αjt di
xj,t ∈ {0,1}j t
j t
t t
0≤xj,t ≤1
ˆxj,t ˆxj,t
j t
j Tj=Pttˆxj,t
θjθ
P0≤t<θ ˆxj,t ≤1
2
Tj> θj/2
θj
j4Tj
C= (C1, . . . , Cm){1, . . . , n}k
(G1, . . . , Gk){1, . . . , n}CiCi
CiGj
k≥n
C m =n
k < n
m k

n m k
x
Ci
(C, k)
(C0, k0) 22k|SC0
i|<
22k(C, k)
(C0, k0)
(C, k)f(k) + P(C)P(C)
C f k