Академический Документы
Профессиональный Документы
Культура Документы
9
* C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph
if ( arce
Algorithms admisibile
* C. Croitoru - Graph în A(i ))* then
Algorithms C. Croitoru - Graph Algorithms * C. Croitoru -
Graphpush
Algorithms
(i ); * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru
- Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C.
else - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms *
Croitoru
C. Croitoru
relabel- Graph
(i );Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms
* C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph
Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru -
Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru
Lema 1
- Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C.
Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms *
"d este funcţie
C. Croitoru distanţă
- Graph Algorithms * C.relativ Algorithms * C.xCroitoru
la prefluxul
Croitoru - Graph " este- Graph
un invariant
Algorithms al
* C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms
algoritmului de mai sus. La fiecare apel relabel (i ), d (i ) creşte. * C. Croitoru - Graph
Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru -
Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru
- Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms *
cândGraph
nuAlgorithms
va trimite flux pe
* C. Croitoru arcul
- Graph ji , când
Algorithms vom avea
* C. Croitoru
0
- Graphd Algorithms
0
Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru -
(j ) = *dC.(iCroitoru
)+1 >
- Graph Algorithms
d (i ) + 1 = d (j ) + 2. * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms *
berg Algorithms
& Tarjan * C. Croitoru O
la (*nC.2 Croitoru
- Graph Algorithms
algoritm) log U )- .Graph Algorithms * C. Croitoru -
Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru
- Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms *
d (j ) -=
Croitoru d (Algorithms
Graph i ) 1 şi * C.iCroitoru
este -primul nod din
Graph Algorithms L(p )).
* C. Croitoru Dacă
- Graph , fluxul
Algorithms *
C.trimis
Croitoru -de
Graph Algorithms * C. Croitoru - Graph Algorithms
la i la j de către apelul push (i ), este limitat la * C. Croitoru - Graph
Algorithms =
* C. Croitoru - GraphpAlgorithms * C. Croitoru - Graph Algorithms
min (ei * C.
Algorithms ; ;
rijCroitoru j ), atunci
2 - eGraph Algorithms(deoarece
* C. Croitoru 2
p >
* C. Croitoru
- GrapheAlgorithms
j
p 1 - Graph
2 * )C.urmează
Croitoru - că o
Graph Algorithmsnesaturată
pompare * C. Croitoru - Graph Algorithms
trimite cel* C. Croitoru
puţin 2p- Graph Algorithms
1 unităţi de* C. Croitoru
flux.
- Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms *
calculează
Graph Algorithms * C. d[ ] = min [ ] + :
i
Croitoru - Graph fdAlgorithms
j ()
Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru -
2 A i- Graph
1 * C.ijCroitoru > 0g * C. Croitoru
şi rijAlgorithms
- Graph Algorithms
repoziţionează* C. Croitoru ()
i în- Graph
L p ;Algorithms * C. Croitoru - Graph Algorithms *
setează poziţia curentă (a pointerului) la începutul listei A i ; ()
Algoritmica Grafurilor - Cursul 9 6 decembrie 2019 21 / 46
Prefluxuri - Algoritmul lui Ahuja & Orlin
C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms
* C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph
Complexitatea timp -aGraph
Algorithms * C. Croitoru algoritmului este
Algorithms * C. dominată
Croitoru de pompările
- Graph Algorithms * C. Croitoru nesat-
-
Graph
urate Algorithms
(ceea * C. Croitoru
ce rămâne - Graph
este deAlgorithms
complexitate O
* C. Croitoru(-nm
Graph Algorithms * C. Croitoru
)).
- Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C.
Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms *
Lema 5 - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms
C. Croitoru
* C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph
Numărul pompărilor
Algorithms Algorithms * C.este
nesaturate
* C. Croitoru - Graph Croitorucel- Graph 8n 2 în* C.
multAlgorithms fiecare
Croitoruetapă
- a
scalării, astfel numărul total este O
Graph Algorithms * C. Croitoru - Graph Algorithms *2 C. Croitoru - Graph Algorithms * C. Croitoru
(n log U ).
- Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C.
Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms *
C. Croitoru - Graph Algorithms
Demonstraţie. Fie * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms
* C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph
Algorithms * C. Croitoru - Graph Algorithms *X
Graph Algorithms * C. CroitoruF (- p
Graph
C. Croitoru - Graph Algorithms * C. Croitoru -
ei d (i )
:
) =Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru
2 6
V ;i =Algorithms
2p - Graph Algorithms * C.
- Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru
Croitoru - Graph Algorithms * C. Croitorui - Graph s ;t * C. Croitoru - Graph Algorithms *
C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms
La începutul F (p ) <
X -2Graph
* C. Croitoru - Graph Algorithms * C. Croitoru
p (2n )
Algorithms
= 2n
* C.
2 Croitoru - Graph
Algorithms * C.etapei
Croitoru p,
- Graph Algorithms * C. Croitoru
p - Graph .
Algorithms * C. Croitoru -
2
Graph Algorithms * C. Croitoru - Graph Algorithms
i V *2C. Croitoru - Graph Algorithms * C. Croitoru
- Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms *
F (pC.) Croitoru
poate- Graph
creşte cel mult până -la 2 şi F (p
4nAlgorithms ) Croitoru
este nenegativ). Evi-
Algorithms * C. Croitoru Graph * C. - Graph Algorithms
* C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph
dent, numărul pompărilor nesaturate este dominat de acest număr de
Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru -
Graph Algorithms
descreşteri ale lui (p ). - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru
* C.FCroitoru
- Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms *
f 2 g;
E1Algorithms
* C. Croitoru - Graph f 2 g;
C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms
= sv1 *:C.vCroitoru
1 V-1Graph = v2 t* C.
E2Algorithms : Croitoru
v2 V- 2Graph
Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru -
f
- Graph Algorithms * C. Croitoru
2 ; 2 g;
Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru
E3 = 2 : v1 * C.VCroitoru
v1 vAlgorithms
- Graph 1 v2 - Graph
V2 Algorithms * C.
: E (G
C.cCroitoru !N
Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms *
1 ) Algorithms
- Graph definită prin - Graph Algorithms * C. Croitoru - Graph Algorithms
* C. Croitoru
* C. Croitoru - Graph Algorithms * C. ( Croitoru - Graph Algorithms * C. Croitoru - Graph
; 2 [
Algorithms * C. Croitoru - Graph Algorithms1 * C.dacă
Croitorue- Graph
E1Algorithms
E2 * C. Croitoru -
1;
Graph Algorithms * C. Croitoru
2
c (e )- Graph
= Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru
- Graph Algorithms * C. Croitoru - Graph Algorithms dacă
* C.eCroitoru
E3- Graph Algorithms *
C. Croitoruorice
- Graphcuplaj
Algorithms 2M
Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms *
Reciproc, M* C. Croitoru G corespunde
- Graph Algorithmsunei mulţimi
* C. Croitoru deAlgorithms
- Graph arce nea-
* C. Croitoru - Graph Algorithms * C. Croitoru
diacente din G1 ; dacă pe fiecare astfel de arc ij (i - Graph Algorithms * C. 2
Croitoru
Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru
- Graph
V1 , j 2 -
V2 )
M M M M (e ) = 0 pe restul
considerăm x
Graph Algorithms = 1 şi x = x
ij * C. Croitorusi- Graph Algorithms
jt = 1, şi adăugăm x
* C. Croitoru - Graph Algorithms * C. Croitoru
- Graph Algorithms * C. Croitoru - Graph
arcelor, atunci fluxul întreg x MAlgorithms satisface* C. Croitoru
v (x M ) - = j j
Graph Algorithms *
M .
Algoritmica Grafurilor - Cursul 9 6 decembrie 2019 26 / 46
Aplicaţii combinatoriale - Cuplaje în grafuri bipartite
C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms
* C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph
Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru -
Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru
Astfel, dacă
- Graph rezolvăm
Algorithms problema
* C. Croitoru fluxului* maxim
- Graph Algorithms C. Croitoruîn R (începând
- Graph Algorithms * C.cu fluxul
nul),Croitoru
atunci - Graph Algorithms
obţinem O
în* C. Croitoru
(nm + 2
- Graph
n log Algorithms
n ) un* cuplaj
C. Croitorude
- Graph Algorithms
cardinal
C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms
*
maxim
în G.
* C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph
;
Fie Algorithms * C. Croitoru - de
(S T ) secţiunea Graph Algorithms * C.
capacitate Croitoru - Graph
minimă (obţinută O
Algorithms
în* C.(Croitoru
Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru
-
m ) dintr-un
flux- maxim determinat).
Graph Algorithms * C. CroitoruDin
- GraphTeorema
Algorithms *deC. flux maxim-
Croitoru secţiune
- Graph Algorithms * C.minimă,
;
Croitoru -
c (S T ) = (G ).
Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms *
<1 \ \
C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms
Deoarece (G
* C. Croitoru )
- Graph , luând
Algorithms i = S - Graph
* C.SCroitoru şi Ti = *TC. Croitoru
Vi Algorithms ;
= 1 2), avem
Vi (i- Graph
j j j j
Algorithms * C. Croitoru - Graph [
Algorithms *
T1 + S2 = (G ) şi X = S1 T2 este o mulţime stabilă înC. Croitoru - Graph Algorithms * C. Croitoru -
G (pentru
<1 j j j n j j n j
Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru
a avea
- Graph ;
c (Algorithms
S T ) * C. Croitoru
). Mai- Graph X =* V
mult,Algorithms T1 -+
C. 1Croitoru V2Algorithms
Graph
S2 =*nC. (G ).
Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms
Urmează că X este o mulţime stabilă de cardinal maxim, deoarece * C. Croitoru - Graph Algorithms *n
C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms
(G*)C.=Croitoru
(G -))Graph
(din teorema
Algorithms * C. lui König).
Croitoru - Graph Algorithms * C. Croitoru - Graph
Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru -
Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru
- Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms *
; ;
(s t ) =*cC.(sCroitoru
Algorithms * C. Croitoru - GraphpAlgorithms
* C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph
t )( - Graph) Algorithms * C. Croitoru -
Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru
- Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C.
În plus,
Croitorunumărul de conexiune
- Graph Algorithms * C. Croitorupe noduri,
- Graph k (G
Algorithms ),Croitoru
* C. al grafului G (valoarea
- Graph Algorithms *
C. Croitoru
maximă a lui p - Graph2N
Algorithms * C. Croitoru - Graph Algorithms
pentru care G este p-conex) este * C. Croitoru -
8Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph
Graph Algorithms
* C. Croitoru - Graph
< n- Graph
Algorithms * C. Croitoru ;
1 Algorithms * C. Croitoru dacă = Kn * C. Croitoru -
G Algorithms
- Graph
k ( G ) =
Graph Algorithms * C. Croitoru ; ;
- Graph Algorithms * C.dacă 6
CroitoruG- Graph
(
= KAlgorithms * C.) Croitoru
- Graph Algorithms *:C. sCroitoru
min c (s t )
2
;t V (G - Graph6 n
);s =t Algorithms * C. Croitoru - Graph Algorithms *
exact câte un
C. Croitoru arcAlgorithms
- Graph de capacitate 1.- Graph Algorithms * C. Croitoru - Graph Algorithms
* C. Croitoru
* C. Croitoru
Urmează că -(din
Graphlegea
Algorithms
Algorithms * C. Croitoru -
de*conservare
Graph
C. Croitoru - Graph
Algorithms * C.
Algorithms * C.
a fluxului)
Croitoru - Graph Algorithms
2f ; g 8 2
căCroitoru
xij0 - Graph
0 1 , ij
* C. Croitoru -
E (GGraph 0 0 k
1 ). Algorithms
Astfel *xC. Croitoru
poate- Graph
fi descompus
Algorithms * C.în v (x - )Graph
Croitoru fluxuri x ,* C.fiecare
Algorithms Croitoru de
- Graph1,Algorithms
valoare * C. Croitoru - Graph
cu proprietatea Algorithms
că arcele pe *care
C. Croitoru - Graphnenul
xk este Algorithms * C.
corespond la
Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms *
0
v (x C.)Croitoru
drumuri intern disjuncte din G. Algorithms * C. Croitoru - Graph Algorithms
- Graph Algorithms * C. Croitoru - Graph
Pe de altă parte, din orice mulţime Graph
* C. Croitoru - Graph Algorithms * C. Croitoru - de pAlgorithms
st -drumuri * C. Croitoru
intern- Graph
disjuncte în
Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru -
G, Graph
putem construi p b a -drumuri
Algorithms * C. Croitorus - Graph
t intern disjuncte în
Algorithms * C. Croitoru - Graph Algorithms G 1 * pe
, care se
C. Croitoru
- Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru
poate transporta o singură unitate de flux. Urmează că v (x ) = p (s t ). - Graph Algorithms0 * ;
Algoritmica Grafurilor - Cursul 9 6 decembrie 2019 37 / 46
Aplicaţii combinatoriale - Conexiunea pe noduri
C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms
* C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph
;
Fie Algorithms
(S T ) *oC.secţiuneCroitoru - Graph
de Algorithms
capacitate * C. Croitoru
minimă - Graph
în Algorithms
R astfel* C. v (- x 0 ) =
Croitoru
încât
;
c (S - Graph
T ). Algorithms
Deoarece * C. Croitoru <1
v (x ) - Graph Algorithms
, urmează 8 2 8 2
Graph Algorithms * C. Croitoru0 - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru
că i - Graph
* C. Croitoru S ,Algorithms
j T
* C. cu ij 2
E (GCroitoru
1 ) ; - Graphc
avem ( ij )<1
Algorithms * C. ,Croitoru
deci -cGraph
( ij )Algorithms
= 1, 9 2
* C. Croitoru
adică u - Graph
V Algorithms
astfel
C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms
*
încât
i = *aC.u Croitoru
şi j =- Graph
bu . Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph
Algorithms
Astfel, * C. Croitoru
secţiunea ;
(S - T Graph Algorithms * C. Croitoru
) coresponde unei -mulţimi
Graph Algorithms * C. Croitoru
de noduri A0- V
astfel încât
- Graph ;
c (S T
Algorithms j j
Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru
* C.) Croitoru
= A0- Graph şi AAlgorithms
0 este o*mulţime
C. Croitoru - st -separatoare.
Graph Algorithms * C.
Croitoru - Graph Algorithms * C. Croitoru
Pe de altă parte, pentru orice mulţime st -separatoare,- Graph Algorithms * C. Croitoru - Graph j j>
A, Algorithms
avem A
C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms
*
;
p (s * tC.) Croitoru 0
= v (x- Graph
). Deci
Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph
Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru -
- Graph Algorithms ; j j ;
Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru
c (s* C.t )Croitoru
= A-0Graph = cAlgorithms
(S T ) *=C.vCroitoru
(x ) = ; :
0 - Graph Algorithms * C. Croitoru
p (sAlgorithms
- Graph t) * C.
Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms *
C. Croitoru - Graph
Demonstraţia de Algorithms
mai sus *arată C. Croitoru
că, -pentru
Graph Algorithms * C. Croitoru
a determina k (G- Graph Algorithms
) este suficient
să determinăm minimul
Algorithms * C. Croitoru - Graphîn
(
Algorithms *)C.rezolvând j
Croitoru - GraphE j
* C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph
(G ) probleme
Algorithms * C. Croitoru de
- flux
Graph Algorithms
maxim, unde G* este C. Croitoru - Graph Algorithms
complementul lui* C.
G.Croitoru - Graph Algorithms * C. Croitoru
- Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms *
*kC. 6
C. Croitoru - Graph Algorithms * C.
(G )
Croitorumin
2
v- Graph
V Algorithms n
n min
dG (v ) = * C. Croitoru
2
dG (v ) 6
1 Croitoru - Graph Algorithms * C.
v -VGraph Algorithms n
1 Croitoru
dG -(Graph
* C. Croitoru v) =
2m
:
- Graph Algorithms
2
Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms
v V * C. Croitoru -
n
Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru
Dacă- Graph
A0 Algorithms * C. Croitoru
este a mulţime - Graph Algorithms
separatoare în G* C.cuj j
Croitoru
A0 - Graph
= k (Algorithms
G ), atunci n
* C. G A0
n 0 ; 00 8 02
Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms *
0 (V V
0
nu este conex
C. Croitoru şi există
- Graph o partiţie
Algorithms of- Graph
* C. Croitoru V A Algorithms * C. )Croitoru
astfel- Graph
încâtAlgorithms
v V
8 00 2 00
şi v* C. Croitoru
V -avem 0 ; 00
Graph Algorithms
p (v v *)C.=Croitoru
k (G )- .Graph Algorithms * C. Croitoru - Graph
Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru -
Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru
- Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms *
Exerciţiul 7. Fie
- Graph Algorithms * C. G = (-V
Croitoru ; E )Algorithms
Graph un graf * C.cu n noduri
Croitoru f ; ;:::; g
Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru
v1 v2 * C. vn şi
- Graph Algorithms
c:E !R
Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru
+ o funcţie de capacitate pe muchiile lui G. O tăietură în G
- Graph Algorithms *
C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms
este* oC. Croitoru
bipartiţie X(S
- Graph ; T ) a *lui
Algorithms V . Capacitatea
C. Croitoru - Graph Algorithmsunei tăieturi
* C. Croitoru - Graph;
(S T ) este
;
Algorithms
c (S T ) = * C. Croitoru - Graph Algorithms
c (e ). * C. Croitoru - Graph Algorithms * C. Croitoru
Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru
-
2 j\ j
e E ; e *SC.=Croitoru
- Graph Algorithms 1 - Graph Algorithms * C. Croitoru - Graph Algorithms *
* C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph
A Algorithms (A) =
V este* C.wCroitoru w (v ). Descrieţi
- Graph Algorithms * C. Croitoru - un algoritm
Graph Algorithms *de compexitate
C. Croitoru -
Graph Algorithms * C. Croitoru2
v A - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru
- Graph Algorithms
polinomială bazat * C.pe
Croitoru
un -algoritm
Graph Algorithms * C. Croitoru
de flux maxim - Graph Algorithms
într-o * C.
anumită reţea
Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms *
careC.să determine
Croitoru o submulţime
- Graph Algorithms * C. Croitoruizolată de pondere
- Graph Algorithms maximă
* C. Croitoru - Graphîn G.
Algorithms
* C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph
Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru -
Graph Algorithms
Exerciţiul 9. Fie* C.G = (S
Croitoru ; T ; Algorithms
- Graph E ) un graf * C. Croitoru - Graph
bipartit. Algorithms * C. Croitoru
Demonstraţi teorema
- Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C.
lui Hall (există un cuplaj în G care saturează toate nodurile din S
Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms *
C. Croitoru
dacă şi numai - Graph dacă
Algorithms
(H) 8 ;j
* C. Croitoru
A - GraphS NAlgorithmsj>j j
G (A) * C. Croitoru - Graph Algorithms
A ) folosind teorema
* C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph
fluxAlgorithms
maxim* C. - Croitoru
secţiune minimă pe o reţea particulară.
- Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru -
Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru
- Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms *