I HC THI NGUYN

TRNG I HC CNTT&TT

CNG CHI TIT LUN VN THC S

Tn ti: MT S BI TON TI U RI RC
TRONG L THYT TH

Gio vin hng dn: GS.TS ng Quang

Hc vin thc hin: Nguyn Anh Vn
Lp:
Caohc K11

Thi Nguyn, thng 10 nm 2013

 CNG CHI TIT LUN VN THC S

Tn ti:

Mt s bi ton ti u ri rc trong l thuyt th.

Gio vin hng dn: GS.TS ng Quang

Hc vin thc hin:

Nguyn Anh Vn

Lp:

Cao hc K11

C s o to:

i hc CNTT v truyn thng - i hc Thi Nguyn

Chuyn ngnh:

Khoa hc my tnh

M s chuyn ngnh:

60.48.01

1. t vn
Trong vi trm nm qua con ngi t c nhiu thnh tu khoa hc,
mt trong nhng thnh tu l s bng n ca ngnh khoa hc my tnh. S
pht trin k diu ca my tnh trong th k ny gn lin vi s pht trin ton
hc hin i, l ton ri rc. Ton hc ri rc nghin cu cc cu trc c tnh
cht ri rc khng lin tc. Ton ri rc bao gm cc lnh vc nh quan h, l
thuyt th, logic ton, ngn ng hnh thc. Trong l thuyt th l mt
b phn trng tm vi nhiu khi lng kin thc kh l th v c nghin cu
nhiu nht. Ton ri rc ni chung v l thuyt th ni ring l cng c thit
yu cho nhiu ngnh khoa hc k thut, v l mt thnh phn quan trng trong
hc vn i vi sinh vin cc ngnh k thut. L thuyt th, vi cch tip cn
i tng nghin cu v phng php t duy kh c o thc s ngy cng
hu ch c nhiu ng dng phong ph v gy khng t bt ng.
L thuyt th l mt lnh vc nghin cu c ngha thc tin cao

bt u t lu. Nhng t tng c bn ca l thuyt th c xut vo

nhng nm u ca th k 18 bi nh ton hc li lc ngi Thy S: Leonhard
Euler. Chnh ng l ngi s dng th gii bi ton ni ting v 7 ci
cu thnh ph Konigberg. Mt cch khng chnh thc, th l mt tp cc
i tng c gi l cc nh (hoc nt) ni vi nhau bi cc cnh (hoc cung).

Cnh c th c hng hoc v hng. th thng c v di dng mt tp

cc im (cc nh ni vi nhau bng cc on thng (cc cnh). C rt nhiu
loi th c nghin cu nh l cy, th ngu nhin, th c hng v
v hng, th trng s v khng c trng s.
Tuy nhin, do vic tnh ton trn th thng l cn khi lng tnh
ton cng nh khng gian nh ln,v vy gn y cng vi s pht trin mnh
m ca k thut my tnh in t, cc bi ton ti u trn th ngy cng c
quan tm v t c nhiu kt qu kh quan.
Ngy nay, cng vi s pht trin mnh m ca khoa hc v cng ngh,
c bit l my tnh, ngi ta c kh nng gii quyt c nhiu bi ton rt
phc tp. Tuy nhin, cn nhng vn l khng gii c cho d k thut
my tnh c pht trin v cng c nhng vn c xem l qu phc tp,
vt mi kh nng tnh ton thc t v mt qu nhiu thi gian. Vic nghin cu
v phc tp ca thut ton cho php chng ta phn loi c cc lp bi
ton theo tng mc phc tp khc nhau, v ch ra ranh gii gia cc lp bi
ton gii c v nhng lp bi ton khng th gii c trong thi gian a
thc.
Nhn thy tnh thit thc ca vn ny v c s gi ca ging
vin hng dn, ti chn ti Mt s bi ton ti u ri rc trong l
thuyt th lm ti cho lun vn tt nghip ca mnh.
2. i tng nghin cu
Tm hiu tng quan v ti u ri rc, mt s bi ton ti u thuc lp P ,
NP-C trong l thuyt th
3. Phm vi nghin cu
Lun vn nghin cu cc kin thc chung v ti u ri rc v l thuyt
th, v tp trung vo mt s bi ton ti u thuc cc lp P, NP-C trong l
thuyt th v cc thut gii chng.
4. Nhim v nghin cu
- Tm hiu chung v ti u ri rc v l thuyt th

- Tm hiu mt s bi ton ti u thuc lp P (Polynomial) trong l thuyt

th v thut gii
- Tm hiu mt s bi ton ti u thuc lp NP-hard trong l thuyt th
v thut gii
- Ci t mt vi thut ton v th nghim
5. Nhng ni dung nghin cu chnh
D kin lun vn gm: Phn m u, ba chng chnh, phn kt lun, ph
lc. B cc nh sau:
Phn m u: Nu l do chn ti v b cc lun vn
Chng 1: Mt s kin thc c bn v l thuyt th cc bi ton NP-C
1.1.

Cc khi nim c bn v th

1.1.1. Cc thut ng c bn
1.1.2. ng i, chu trnh v th lin thng
1.1.3. th c trng s
1.1.4. Cc cu trc d liu biu din th
1.2. Khi nim v lp cc bi ton P v NP
1.2.1. Khi nim cc loi thi gian tnh
1.2.2. Lp bi ton P.
1.2.3. Lp bi ton NP.
1.2.4. Lp bi ton NP-y (NP-Complete).
1.2.5. Lp bi ton NP- kh (NP-Hard).
Chng 2. Mt s bi ton ti u lp P trong th.
2.1. Mt s thut ton tm cy khung b nht
2.1.1. Thut ton Kruskal
2.1.2. Thut ton Prim
2.2. Thut ton tm ng i ngn nht trn th
2.3. Ci t th nghim mt s thut ton
Chng 3. Mt s bi ton ti u thuc lp NP-C trong th
3.1. Bi ton tm tp nh c lp v bi ton ph nh

3.2. Bi ton t mu th
3.3. Bi ton clique
3.4. Bi ton ngi bn hng rong
3.5. Ci t th nghim mt s thut ton
Phn kt lun
Phn ph lc
6. Phng php nghin cu
- Phng php c ti liu.
- Phng php quan st.
- Phng php phn tch - tng hp l thuyt.
- Phng php thc nghim.
7. D kin k hoch thc hin ti
Thi gian

Cng vic thc hin

Kt qu t c
Tm hiu v mt s kin thc
Chng 1: Mt s kin
T 01/12/2013 c bn v l thuyt th v
thc c bn v l thuyt
n 01/01/2014 cc bi ton thuc lp P, NP,
th cc bi ton NP-C
NP-C
Tm hiu mt s bi ton ti
Chng 2: Mt s bi
T 02/01/2014 u lp P trong th
ton ti u lp P trong
n 15/03/2014 Ci t th nghim mt s
th.
thut ton lp P
Tm hiu mt s bi ton ti
T 16/03/2014
n 30/07/2014

u thuc lp NP-C trong Chng 3: Mt s bi

th

ton ti u thuc lp

Ci t th nghim mt s NP-C trong th

thut ton lp NP-C

T 01/07/2014
n 20/07/2014

Hon chnh bo co, lm slide

8. Ti liu tham kho

- Lun vn y
- Slide hon chnh

[1].

ng Quang , Bi ging v Mt s phng php ton hc chn lc trong

CNTT.
[2].

Nguyn c Ngha, Nguyn Thanh Hng, Gio trnh l thuyt th, NXB

i hc Quc gia TPHCM

[3].

Y. Bejerano and R. Ratogi, Robust Monitoring of link delays and faults in IP

networks, In Proceedings of IEEE INFOCOM, 2003.

[4].

M. Faloutsos, P. Faloutsos, and C. Faloutsos, On Power-Law Relationships of

the Internet, In Proceedings of ACM SIGCOMM, 1999

[5].

H. L. Bodlaender. Dynamic programming on graphs with bounded treewidth.

Technical Report RUU-CS-87-22, Utrecht University, 1987.

[6].

H. L. Bodlaender. A tourist guide through treewidth. Acta Cybernet., 11(1-2):1

22, 1993.
[7].

H. L. Bodlaender. A linear time algorithm for finding tree-decompositions of

small treewidth. SIAM J. Comput., 25(6):13051317, 1996.

[8].

U. Feige. Approximating maximum clique by removing subgraphs. Manuscript,

2002.
[9].

M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the

Theory of NP-completeness. Freeman, New York, 1979.

[10]. Artur Czumaj et al., Approximation algorithms for optimization problems in
graphs with superlogarithmic treewidth, http://www.ru.is/~mmh/papers/lingas.pdf.
Thi Nguyn, ngy thng
Xc nhn ca gio vin hng dn.

GS.TS ng Quang

nm 2013

Hc vin

Nguyn Anh Vn