Professional Documents
Culture Documents
Agr13 PDF
Agr13 PDF
width
Graph Algorithms * C. Croitoru T
- Graph j j
Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru -
( )Algorithms
= max* C.(Croitoru
Vt - Graph1): Algorithms * C. Croitoru
t 2V (T*) C. Croitoru - Graph Algorithms *
- Graph Algorithms * C. Croitoru - Graph Algorithms
* C. tw
Croitoru f width
Algorithms T T
( Croitoru
* C. ) : - Graphtree-descompunere
Algorithms * C. Croitorua- lui g
C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms
(G )- Graph
= min GraphG :
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 - 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 - 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 - 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.?
Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru -
tw (G )=
Graph 0 dacă* şi
Algorithms numai- Graph
C. Croitoru E (G ) =
dacăAlgorithms .
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 *
Propoziţie
C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms
* C.G
Dacă Croitoru
este -oGraph Algorithms
pădure cu *EC.(G 6 ?
Croitoru
) = - Graph Algorithms
, atunci tw (*G C.)Croitoru
= 1. - Graph
Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru -
* C. Croitoru - Graph
f g
u pentru orice tu asociat
* C. Croitoru - Graph
2
C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms
setează Vtu =Algorithms lui u V (G ) şi Vtuv =
Algorithms * C. Croitoru - Graph
f
Algorithmsg
u ; v *pentru
C. Croitoru - Graph
orice 2 V (T
Algorithms
tuv ) Croitoru
* C. asociat - Graph 2
uv E (*G
lui Algorithms C.)Croitoru
. -
f 2 g
Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru
(T ; Algorithms
- Graph Vt : t * C.VCroitoru
(T ) -)Graph
esteAlgorithms
o tree-descompunere a lui G *cu lăţimea
* C. Croitoru - Graph Algorithms
1.
Algoritmica Grafurilor - Cursul 13 17 ianuarie 2020 6 / 21
Tree-width
C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms
Demonstraţie (continuare). O tree-descompunere a unei păduri cu
* C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph
Algorithms * C. Croitoru
p componente - Graph
se poate Algorithms
obţine * C. Croitoruarbitrar
adăugând - Graph Algorithms
p 1* muchii
C. Croitorula
- tree-
Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru
descompunerile componentelor (fără a crea circuite).
- 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 - 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 - 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 - 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 - 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 *
G, atunci j j6j j
Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru
T
- Graph Algorithms *G .
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. * C. Croitorudupă
Prin inducţie - Graph n j j
Algorithms
= G* .C. Croitoru
Dacă - n Graph
=Algorithms
1, atunci
j j * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph
= 1.
T Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru -
Graph Algorithms
În pasul inductiv, * C. Croitoru
pentru - Graph >
n Algorithms * C. Croitoru - o
2, considerăm Graph Algorithms
frunză t1 *aC.lui
Croitoru
T cu
vecinul t2-. Graph
Croitoru f 2
t1 ; V*tC. Croitoru
(T Algorithms : t -V Graph g
- Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C.
(TAlgorithms
t1 ) )* C.
este o tree-descompunere
Croitoru - Graph Algorithms *
C. Croitoru
small a lui G - Graph n
0 = Algorithms
G (Vt1* C. V n Croitoru
t2 ) .
* C. Croitoru - Graph Algorithms * C. Croitoru
- Graphipoteza
Din Algorithmsinductivă j
* C. Croitoru - T j6j j
Graph Algorithms
- Graph Algorithms * C. Croitoru - Graph
t1 G0 ,
astfel
Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru -
Graph Algorithms * C.Tj j j
Croitoru
= T j
- GraphtAlgorithms
1 +1 6j j* C. 0
GCroitoru 6j j
+ 1 - Graph
GAlgorithms
:
- Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms *
* C. Croitoru
Întrebare: G TW
- Graph Algorithms2
Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru
k?
* 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
Teoremă
* C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph
Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru -
Problema Tree-Width
Graph Algorithms * C. Croitoru( - Graph
versiunea
Algorithmsde* C.decizie) esteAlgorithms
Croitoru - Graph o problemă NP-
* C. Croitoru
- Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C.
completă.
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 - GraphOmisă.
Demonstraţie. 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.Fie H 0 - Graph
Croitoru 00 două *subgrafuri
şi HAlgorithms C. Croitoru - Graph aleAlgorithms
lui G, *cu C. Croitoru c 0 şi c 00 ,
- Graph Algorithms
p-colorările
* C. Croitoru - Graph00Algorithms0 * C. Croitoru - Graph Algorithms * C. Croitoru - Graph
respectiv.
Algorithms c este
* C. Croitoru c -compatibilă
- Graph Algorithms * C. Croitoru dacă- Graph
pentru 2 V -(H 0 )
orice* C.vCroitoru
Algorithms \
Graph
V (H 00
Algorithms
) avem 0
* C.cCroitoru
(v ) = 00
- Graph
c (vAlgorithms
). * C. Croitoru - Graph Algorithms * C. Croitoru
- Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C.
Croitoru T
Fie - Graph= (T f
Algorithms 2
; Vt *: C.tCroitoru V (- T g
) )Algorithms
Graph tree-descompunere cuAlgorithms
* C. Croitoru - Graph rădăcină * a
lui G. Pentru orice t 2
C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms
T şi orice p-colorare c a lui
* C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph
G t , definim
(
Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru -
Graph Algorithms * C. Croitoru 1; dacă
- Graph G [t ] are* o
Algorithms C. p-colorare ; c-compatibilă
Croitoru - GraphcAlgorithms * C. Croitoru
Prev
- Graph t (c ) =* C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C.
Algorithms
Croitoru - Graph Algorithms 0;* C.altfel.
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
Propoziţie
Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru -
Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru
orice -copil
Graph Algorithms
v al lui *u, C. Croitoru
Prev u (c )Algorithms
- Graph
= 1 dacă şi numai dacă pentru
* C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms *
există o
colorare c a lui Gv , c-compatibilă cu Prevv (c ) = 1
Algoritmica Grafurilor - Cursul 13 17 ianuarie 2020 17 / 21
Aplicaţii - Colorarea nodurilor
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
Demonstraţie. )
“ = - Graph
” dacă
este
Algorithms * C. colorare
Croitoru - Graph Algorithms
a lui G [u ],* C. Croitoru -
c-compatibilă,
Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru
cum- Graph
Gv Algorithms
este un *aC.subgraf al lui
Croitoru - Graph G [u ],* atunci
Algorithms C. Croitorurestricţia lui
* C.la Gv ne
- Graph Algorithms
Croitoru
oferă - Graph Algorithms
colorarea dorită, *c.C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms *
( C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms
“ =* ”C. Presupunem că u *are
Croitoru - Graph Algorithms exact- Graph
C. Croitoru doi Algorithms
copii v *şiC. Croitoru
w , şi -că Graphavem două
colorări c 0 *şiC.cCroitoru
Algorithms 00 , c-compatibile,
- Graph Algorithms *respectiv
C. Croitoru - Graph Algorithms * C. este
(demonstraţia Croitorusimilară
-
Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru
pentru mai
- Graph mulţi* copii).
Algorithms C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C.
Graph f
Deoarece (T ; Vt : t * C.VCroitoru
Croitoru - Algorithms 2 g
(T ) -)Graph
esteAlgorithms * C. Croitoru - Graph Algorithms
o tree-descompunere, \
V (G [v* ])
V (G* C.
C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms
[wCroitoru
]) V u , urmează
- Graph Algorithms *că C. c
0 00
este- Graph
Croitoru c -compatibilă.
Algorithms * C. Croitoru - Graph
0 00
Combinând c şi c obţinem c : Croitoru
Algorithms * C. Croitoru - Graph Algorithms * C. V (G [-uGraph ! f
]) Algorithms g
1; 2;* :C.: :Croitoru
; p . - Cum
f 2 g
Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru
(T ;- Graph : t
Vt Algorithms *VC. (Croitoru
T ) ) - este o tree-descompunere,
Graph Algorithms nu există
* C. Croitoru - Graph Algorithms * C. muchii
2 E (G )- cu
xy C. Croitoru 2 2
Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms *
x V (G [v ]) V şi y V (G [w ]) V , deci c este o
Graph Algorithms * C. Croitoru u- Graph Algorithms * C. Croitoru -uGraph Algorithms
p-colorare a lui
* C. Croitoru [u ].
G Algorithms
- Graph * 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 *
Algoritmica Grafurilor - Cursul 13 17 ianuarie 2020 18 / 21
Aplicaţii - Colorarea nodurilor
C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms
Teoremă
* C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph
; fVt :
Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru -
Dacă G,Algorithms
Graph un graf* C.deCroitoru
ordin n, are
- Graph o tree-descompunere
Algorithms small* C.
* C. Croitoru - Graph Algorithms (TCroitoru
t 2 V (T )g) cu lăţimea w , atunci putem decide dacă G este p-colorabil
- Graph Algorithms * C. Croitoru - Graph Algorithms * C. Croitoru - Graph Algorithms * C.
în timpul O-(Graph
C. Croitoru
1 n O*(1C.
Croitoru - GraphwAlgorithms
p +Algorithms ) 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
Sfârşit!
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 - 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 - 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 - 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 *