MCS100. One can begin to reason only when a clear picture has been formed in the imagination.

Size: px
Start display at page:

Download "MCS100. One can begin to reason only when a clear picture has been formed in the imagination."

Transcription

1 642 ptr 10 Grps n Trs 46. Imin tt t irmsown low is mp wit ountris ll. Is it possil to olor t mp wit only tr olors so tt no two jnt ountris v t sm olor? To nswr tis qustion, rw n nlyz rp in wi ountry is rprsnt y vrtx n two vrtis r onnt y n i, n only i, t ountris sr ommon orr. 47. In tis xris rp is us to lp solv sulin prolm. Twlv ultymmrs in mtmtis prtmnt srv on t ollowin ommitts: Unrrut Eution: Tnnr, Ptrson, Ksin, on Grut Eution: Gtto, Yn, on, toiu olloquium: Sin, MMurry,s Lirry: ortzn, Tnnr, Sin irin: Gtto, MMurry, Yn, Ptrson Prsonnl: Yn, Wn, ortzn T ommitts mustllmt urin t irst wk o lsss, ut tr r only tr tim slots vill. Fin sul tt will llow ll ulty mmrs to ttn t mtins o ll ommitts on wi ty srv. To o tis, rprsnt ommitt s t vrtx o rp, n rw n twn two vrtis i t two ommitts v ommon mmr. Fin wy to olor t vrtis usin only tr olors so tt no two ommitts v t sm olor, n xplin ow to us t rsult to sul t mtins. 48. prtmnt wnts to sul inl xms so tt no stunt smor tn on xm on ny ivn y. T vrtis o t rp low sow t ourss tt r in tkn y mor tn on stunt, wit n onntin two vrtis i tr is stunt in ot ourss. Fin wy to olor t vrtis o t rp wit only our olors so tt no two jnt vrtis v t sm olor n xplin ow to us t rsult to sul t inl xms. MS100 MS135 MS101 MS130 MS102 MS120 MS110 nswrs or Tst Yoursl 1. init, nonmpty st o vrtis; init st o s; on or two vrtis ll its npoints 2. n wit sinl npoint 3. ty v t sm st o npoints 4. ty r onnt y n 5. oits npoints 6. jnt 7. isolt 8. n orr pir o vrtisll its npoints 9. rp wit no loops or prlll s 10. simpl rp wit n vrtis wos st o s ontins xtly on or pir o vrtis 11. onnt y n ; ny otr vrtx in V 1 ;ny otr vrtx in V vry vrtx in is lso vrtx in G; vry in is lso n in G; vry in s t sm npoints s it s in G 13. t numr o s tt r inint on t vrtx, wit n tt is loop ount twi 14. t sum o t rs o ll t vrtis o t rp 15. qul to twi t numr o s o t rp 16. n vn numr 10.2 Trils, Pts, n iruits On n in to rson only wn lr pitur s n orm in t imintion. W.W.Swyr, Mtmtiin s lit, 1943 T sujt o rp tory n in t yr 1736 wn t rt mtmtiin Lonr Eulr pulis ppr ivin t solution to t ollowin puzzl: T town o Könisr in Prussi (now Klininr in Russi) ws uilt t point wr two rns o t Prl Rivr m totr. It onsist o n isln n som ln lon t rivr nks.ts wr onnt ysvn ris ssown in Fiur T qustion is tis:is it possil or prson to tk wlk roun town, strtin n nin t t smlotion nrossin o t svn ris xtly on? In is oriinl ppr, Eulr i not rquir t wlk to strt n n t t sm point. T nlysis o t prolm is simplii, owvr, y in tis onition. Ltr in t stion, w isuss wlks tt strt n n t irnt points. opyrit 2010 n Lrnin. ll Rits Rsrv. My not opi, snn, or uplit, in wol or in prt. u to ltroni rits, som tir prty ontnt my supprss rom t ook n/or ptr(s). Eitoril rviw s m tt ny supprss ontnt os not mtrilly t t ovrll lrnin xprin. n Lrnin rsrvs t rit to rmov itionl ontnt t ny tim i susqunt rits rstritions rquir it.

2 10.2 Trils, Pts, n iruits 643 Prl Rivr Mrin-Ern Fiur T Svn ris o Könisr To solv tis puzzl, Eulr trnslt it into rp tory prolm. noti tt ll points o ivn lnmss n intii wit otr sin prson n trvl rom ny on point to ny otr point o t sm lnmss witout rossin ri. Tus or t purpososolvin t puzzl, t mp o Könisr n intii wit t rp sown in Fiur , in wi t vrtis,,, n rprsnt ln msss n t svn s rprsnt t svn ris. Lonr Eulr ( ) ttmnn/oris Fiur Grp Vrsion o Könisr Mp In trms o tis rp, t qustion oms t ollowin: Equivlntly: Is it possil to in rout trou t rp tt strts n ns t som vrtx, on o,,, or,n trvrss xtly on? Is it possil to tr tis rp, strtin n nin t t sm point, witout vr litin your pnil rom t ppr? Tk w minuts to tink out t qustion yoursl. n you in rout tt mts t rquirmnts? Try it! Lookin or rout is rustrtin us you ontinully in yoursl t vrtx tt os not v n unus on wi to lv, wil lswr tr r unus s tt must still trvrs. I you strt t vrtx, or xmpl, tim you pss trou vrtx,, or, you us up twos us you rriv on on n prt on irnt on. So, i it is possil to in rout tt uss ll t s o t rp n strts n ns t, tn t totl numr o rrivls n prturs rom vrtx,, n must multipl o 2. Or, in otr wors, t rs o opyrit 2010 n Lrnin. ll Rits Rsrv. My not opi, snn, or uplit, in wol or in prt. u to ltroni rits, som tir prty ontnt my supprss rom t ook n/or ptr(s). Eitoril rviw s m tt ny supprss ontnt os not mtrilly t t ovrll lrnin xprin. n Lrnin rsrvs t rit to rmov itionl ontnt t ny tim i susqunt rits rstritions rquir it.

3 644 ptr 10 Grps n Trs t vrtis,, n must vn. ut ty r not: () = 5, () = 3, n () = 3. n tr is no rout tt solvs t puzzl y strtin n nin t. Similr rsonin n us to sow tt tr r no routs tt solv t puzzl y strtin n nin t,, or. Tror, it is impossil to trvl ll roun t ity rossin ri xtly on. initions Trvl in rp is omplis ymovin rom on vrtx to notr lon squn o jnt s. In t rp low, or instn, you n o rom u 1 to u 4 y tkin 1 to u 2 n tn 7 to u 4.Tis is rprsnt y writin u 1 1 u 2 7 u 4. u u 3 u 1 u 4 5 u5 6 Or you oul tk t rounout rout u 1 1 u 2 3 u 3 4 u 2 3 u 3 5 u 4 6 u 4 7 u 2 3 u 3 5 u 4. rtin typs o squns o jnt vrtis n s r o spil importn in rp tory: tos tt o not v rpt, tos tt o not v rpt vrtx, n tos tt strt n n t t sm vrtx. inition Lt G rp, n lt v n w vrtis in G. wlk rom v tow is init ltrntin squn o jnt vrtis n s o G. Tus wlk s t orm v v n 1 n v n, wr t v s rprsnt vrtis, t s rprsnt s, v 0 = v, v n = w, n or ll i = 1, 2,...n,v i 1 n v i r t npoints o i.ttrivil wlk rom v to v onsists o t sinl vrtx v. tril rom v to w is wlk rom v to w tt os not ontin rpt. pt rom v to w is tril tt os not ontin rpt vrtx. los wlk is wlk tt strts n ns t t sm vrtx. iruit is los wlk tt ontins t lst on n os not ontin rpt. simpl iruit is iruit tt os not v ny otr rpt vrtx xpt t irstn lst. opyrit 2010 n Lrnin. ll Rits Rsrv. My not opi, snn, or uplit, in wol or in prt. u to ltroni rits, som tir prty ontnt my supprss rom t ook n/or ptr(s). Eitoril rviw s m tt ny supprss ontnt os not mtrilly t t ovrll lrnin xprin. n Lrnin rsrvs t rit to rmov itionl ontnt t ny tim i susqunt rits rstritions rquir it.

4 10.2 Trils, Pts, n iruits 645 For s o rrn, ts initions r summriz in t ollowin tl: Rpt Rpt Strts n Ens Must ontin t E? Vrtx? t Sm Point? Lst On E? Wlk llow llow llow no Tril no llow llow no Pt no no no no los wlk llow llow ys no iruit no llow ys ys Simpl iruit no irstn ys ys lst only Exmpl Nottion or Wlks Otn wlk n spiiunmiuously y ivin itr squnos or squn o vrtis. T nxt twoxmpls sow ow tis ison.. In t rp low, t nottion rrsunmiuously to t ollowin wlk: On t otr n, t nottion 1 is miuous i us to rr to wlk. It oul mn itr 1 or v In t rp o prt (), t nottion is miuous i us to rr to wlk. It oul mn 2 or 3. On t otr n, in t rp low, t nottion rrsunmiuously to t wlk Not tt i rp G os not v ny prlll s, tn ny wlk in G isuniquly trmin y itssqun o vrtis. Exmpl Wlks, Trils Pts, n iruits In t rp low, trmin wi o t ollowin wlks r trils, pts, iruits, or simpl iruits v opyrit 2010 n Lrnin. ll Rits Rsrv. My not opi, snn, or uplit, in wol or in prt. u to ltroni rits, som tir prty ontnt my supprss rom t ook n/or ptr(s). Eitoril rviw s m tt ny supprss ontnt os not mtrilly t t ovrll lrnin xprin. n Lrnin rsrvs t rit to rmov itionl ontnt t ny tim i susqunt rits rstritions rquir it.

5 646 ptr 10 Grps n Trs Solution. Tis wlk s rpt vrtx ut os not v rpt, so itis tril rom to ut not pt.. Tis is just wlk rom to.itis not tril us its rpt.. Tis wlk strts n ns t, ontins t lst on, nos not v rpt, so itis iruit. Sin t vrtx is rpt in t mil, it is not simpl iruit.. Tis wlk strts n ns t, ontins t lst on, os not v rpt, n os not v rpt vrtx. Tus it is simpl iruit.. Tis is just los wlk strtin n nin t.itis not iruit us 1 is rpt.. T irst vrtx o tis wlk is t sm s its lst vrtx, ut itos not ontin n, n soitis not iruit. It is los wlk rom to.(itislso tril rom to.) us most o t mjor vlopmnts in rp tory v ppn rltivly rntly n in vrity o irnt ontxts, t trms us in t sujt v not n stnriz. For xmpl, wt tis ook lls rp is somtims ll multirp, wt tis ook lls simpl rp is somtims ll rp, wt tis ook lls vrtx is somtims ll no, n wt tis ook lls n is somtims ll n r. Similrly, inst o t wor tril, t wor pt is somtims us; inst o t wor pt, twors simpl pt r somtims us; n inst o t wors simpl iruit,twor yl issomtimsus. T trminoloy in tis ook is mon t most ommon, ut iyou onsult otr sours, sur to k tir initions. onntnss It is sy to unrstn t onpt o onntnss on n intuitiv lvl. Rouly spkin, rp is onnt i it is possil to trvl rom ny vrtx to ny otr vrtx lon squn ojnt s o t rp. T orml inition o onntnss isstt in trms o wlks. inition Lt G rp. Two vrtis v n w o G r onnt i, n only i, tr is wlk rom v to w. Trp G is onnt i, n only i, ivn ny two vrtis v n w in G, tr is wlk rom v to w. Symolilly, G is onnt vrtis v, w V (G), wlkrom v to w. I you tk t ntion o tisinition, you will s tt rp G is not onnt i, n only i, tr r two vrtis o G tt r not onnt y ny wlk. Exmpl onnt n isonnt Grps Wi o t ollowin rps r onnt? v 2 v2 v 4 v v v3 1 6 v 8 v 7 () () () opyrit 2010 n Lrnin. ll Rits Rsrv. My not opi, snn, or uplit, in wol or in prt. u to ltroni rits, som tir prty ontnt my supprss rom t ook n/or ptr(s). Eitoril rviw s m tt ny supprss ontnt os not mtrilly t t ovrll lrnin xprin. n Lrnin rsrvs t rit to rmov itionl ontnt t ny tim i susqunt rits rstritions rquir it.

6 10.2 Trils, Pts, n iruits 647 Solution T rp rprsnt in () isonnt, wrs tos o () n () r not. To unrstn wy () is not onnt, rll tt in rwin o rp, two s myross t point tt is not vrtx. Tus t rp in () n rrwn s ollows: Som usul ts rltin iruits n onntnss r ollt in t ollowin lmm. Proos o () n () r lt or t xriss. T proo o ()is in Stion Lmm Lt G rp.. I G isonnt, tn ny twoistint vrtis o G n onnt y pt.. I vrtis v n w r prt o iruit in G n on is rmov rom t iruit, tn tr still xists tril rom v to w in G.. IG is onnt n G ontins iruit, tn n o t iruit n rmov witout isonntin G. Look k texmpl T rps in () n () r ot m up o tr pis, o wi is itsl onnt rp. onnt omponnt o rp is onnt surp o lrst possil siz. inition rp is onnt omponnt o rp G i, n only i, 1. issurp o G; 2. isonnt; n 3. noonnt surp o G s s surp n ontins vrtis or s tt r not in. T t is tt ny rp is kin o union o itsonnt omponnts. Exmpl onnt omponnts Fin ll onnt omponnts o t ollowin rp G v 8 v 7 opyrit 2010 n Lrnin. ll Rits Rsrv. My not opi, snn, or uplit, in wol or in prt. u to ltroni rits, som tir prty ontnt my supprss rom t ook n/or ptr(s). Eitoril rviw s m tt ny supprss ontnt os not mtrilly t t ovrll lrnin xprin. n Lrnin rsrvs t rit to rmov itionl ontnt t ny tim i susqunt rits rstritions rquir it.

7 648 ptr 10 Grps n Trs Solution G s tr onnt omponnts: 1, 2,n 3 wit vrtx sts V 1, V 2,n V 3 n sts E 1, E 2,n E 3, wr Eulr iruits V 1 ={,, }, E 1 ={ 1, 2 }, V 2 ={ }, E 2 =, V 3 ={,,v 7,v 8 }, E 3 ={ 3, 4, 5 }. Now w rturn to onsir nrl prolms similr to t puzzl o t Könisr ris. T ollowin inition ism in onor o Eulr. inition Lt G rp. n Eulr iruit or G is iruit tt ontins vry vrtx n vry o G. Tt is, neulr iruit or G is squn ojnt vrtis n s in G tt s t lst on, strts n ns t t sm vrtx, uss vry vrtx o G t lst on, n uss vry o G xtly on. T nlysisus rlir to solv t puzzl o t Könisr ris nrlizs to prov t ollowin torm: Torm I rp s n Eulr iruit, tn vry vrtx o t rp s positiv vn r. Proo: Suppos G is rp tt s n Eulr iruit. [W must sow tt ivn ny vrtx v o G, t r o v is vn.] Lt v ny prtiulr ut ritrrily osn vrtx o G.Sin t Eulr iruit ontins vry o G,itontins ll s inint on v. Nowimin tkin journy tt ins in t mil o on o t s jnt to t strt o t Eulr iruit nontinus roun t Eulr iruit to n in t mil o t strtin. (S Fiur Tr is sustrtin us teulr iruit s t lst on.) E tim v is ntr y trvlin lon on, it is immitly xit y trvlin lon notr (sin t journy ns in t mil o n ). Strt r v 0 First ntry/xit pir o s In tis xmpl, t Eulr iruit is v 0 v 0,n v is. E tim is ntr y on, it is xit y notr. Son ntry/xit pir o s Fiur Exmpl or t Proo o Torm opyrit 2010 n Lrnin. ll Rits Rsrv. My not opi, snn, or uplit, in wol or in prt. u to ltroni rits, som tir prty ontnt my supprss rom t ook n/or ptr(s). Eitoril rviw s m tt ny supprss ontnt os not mtrilly t t ovrll lrnin xprin. n Lrnin rsrvs t rit to rmov itionl ontnt t ny tim i susqunt rits rstritions rquir it.

8 10.2 Trils, Pts, n iruits 649 usteulr iruit uss vry o G xtly on, vry inint on v is trvrs xtly on intis pross. n t s inint on v our in ntry/xit pirs, n onsquntly t r o v must positiv multipl o 2. ut tt mns tt v s positiv vn r [s ws to sown]. Rll tt t ontrpositiv o sttmnt is loilly quivlnt to t sttmnt. T ontrpositiv o Torm is s ollows: ontrpositiv Vrsion o Torm I som vrtx o rp s o r, tn t rp os not v n Eulr iruit. Tis vrsion o Torm isusul or sowin tt ivn rp os not v n Eulr iruit. Exmpl Sowin Tt Grp os Not v n Eulr iruit Sow tt t rp low os not v n Eulr iruit Solution Vrtis n ot v r 3, wiiso. ny (t ontrpositiv orm o) Torm , tis rp os not v n Eulr iruit. Now onsir t onvrs o Torm : I vry vrtx o rp s vn r, tn t rp s n Eulr iruit. Is tis tru? T nswr is no. Tr is rp G su tt vry vrtx o G s vn r ut G os not v n Eulr iruit. In t, tr r mny su rps. T illustrtion low sows on xmpl Evry vrtx s vn r, ut t rp os not v n Eulr iruit. Not tt t rp in t prin rwin is not onnt. It turns out tt ltou t onvrs o Torm is ls, moii onvrs is tru: I vry vrtx o rp s positiv vn r n i t rp is onnt, tn t rp s n Eulr iruit. T proo o tis t isonstrutiv: It ontins n loritm to in n Eulr iruit or ny onnt rp in wi vry vrtx s vn r. opyrit 2010 n Lrnin. ll Rits Rsrv. My not opi, snn, or uplit, in wol or in prt. u to ltroni rits, som tir prty ontnt my supprss rom t ook n/or ptr(s). Eitoril rviw s m tt ny supprss ontnt os not mtrilly t t ovrll lrnin xprin. n Lrnin rsrvs t rit to rmov itionl ontnt t ny tim i susqunt rits rstritions rquir it.

9 650 ptr 10 Grps n Trs Torm I rp G is onnt n t r o vry vrtx o G is positiv vn intr, tn G s n Eulr iruit. Proo: Suppos tt G is ny onnt rp n suppos tt vry vrtx o G is positiv vn intr. [W must in n Eulr iruit or G.] onstrut iruit y t ollowin loritm: Stp 1: Pik ny vrtx v o G t wi tostrt. [Tis stp n omplis us t vrtx st o G is nonmpty y ssumption.] Stp 2: Pik nysqun ojnt vrtis n s, strtin n nin t v n nvr rptin n. ll t rsultin iruit. [Tis stp n prorm or t ollowin rsons: Sin t r o vrtx o G is positiv vn intr, s vrtx o G is ntr y trvlin on on, itr t vrtx is v itsl n tr is no otr unus jnt to v, or t vrtx n xit y trvlin on notr prviously unus. Sin t numr o s o t rp is init (y inition o rp), t squn o istint s nnot o on orvr. T squn n vntully rturn to v us t r o v is positiv vn intr, n so i n onnts v to notr vrtx, tr must irnt tt onnts k to v.] Stp 3: k wtr ontins vry n vrtx o G. Iso, is n Eulr iruit, n w r inis. I not, prorm t ollowin stps. Stp 3: Rmov ll s o rom G n lso ny vrtis tt om isolt wn t s o r rmov. ll t rsultin surp G. [Not tt G my not onnt (s illustrt in Fiur ), ut vry vrtx o G s positiv, vn r (sin rmovin t s o rmovs n vn numr o s rom vrtx, t irn o two vn intrs is vn, n isolt vrtis wit r 0 wr rmov.)] u v w G: G' Fiur Stp 3: Pik ny vrtx w ommon to ot n G. [Tr must t lst on su vrtx sin G is onnt. (S xris 44.) (In Fiur tr r two su vrtis: u n w.)] Stp 3: Pik nysqun ojnt vrtis n s o G, strtin n nin t w n nvr rptin n. ll t rsultin iruit. [Tis n on sin vrtx o G s positiv, vn r n G is init. S t justiition or stp 2.] opyrit 2010 n Lrnin. ll Rits Rsrv. My not opi, snn, or uplit, in wol or in prt. u to ltroni rits, som tir prty ontnt my supprss rom t ook n/or ptr(s). Eitoril rviw s m tt ny supprss ontnt os not mtrilly t t ovrll lrnin xprin. n Lrnin rsrvs t rit to rmov itionl ontnt t ny tim i susqunt rits rstritions rquir it.

10 10.2 Trils, Pts, n iruits 651 Stp 3: Pt n totr to rt nw iruit s ollows: Strt t v n ollow ll t wy to w. Tn ollow ll t wy ktow. tr tt, ontinu lon t untrvl portion o to rturn to v. [T t o xutin stps 3 n 3 or t rp o Fiur is sown in Fiur ] ' u v w G: Fiur '' Stp 3: Lt = n o k tostp 3. Sin t rp G is init, xution o t stps outlin in tis loritm must vntully trmint. t tt point n Eulr iruit or G will v n onstrut. (Not tt us o t lmnt o oi instps 1, 2, 3, n 3, vrity o irnt Eulr iruits n prou yusin tis loritm.) Exmpl Finin n Eulr iruit Us Torm to k tt t rp low s n Eulr iruit. Tn us t loritm rom t proo o t torm to in n Eulr iruit or t rp. i Solution j Osrv tt () = () = () = ( ) = () = (i) = ( j) = 2 n tt () = () = () = 4. n ll vrtis v vn r. lso, t rp is onnt. Tus, y Torm , t rp s n Eulr iruit. To onstrutneulr iruit usin t loritm o Torm , lt v = n lt :. is rprsnt y t ll s sown low j i opyrit 2010 n Lrnin. ll Rits Rsrv. My not opi, snn, or uplit, in wol or in prt. u to ltroni rits, som tir prty ontnt my supprss rom t ook n/or ptr(s). Eitoril rviw s m tt ny supprss ontnt os not mtrilly t t ovrll lrnin xprin. n Lrnin rsrvs t rit to rmov itionl ontnt t ny tim i susqunt rits rstritions rquir it.

11 652 ptr 10 Grps n Trs Osrv tt is not n Eulr iruit or t rp ut tt intrsts t rst o t rp t. Lt Pt into to otin : ji. : ji. St =. Tn is rprsnt y t ll s sown low i j Osrv tt is not n Eulr iruit or t rp ut tt it intrsts t rst o t rp t. Lt Pt into to otin :. : ji. St =. Tn is rprsnt y t ll s sown low i 11 j Sin inlus vry o t rp xtly on, is n Eulr iruit or t rp. In xris 45 t t n o tis stion you r sk to sow tt ny rp wit n Eulr iruit is onnt. Tis rsult n omin wit Torms n to iv omplt rtriztion o rps tt v Eulr iruits, s stt in Torm Torm rp G s n Eulr iruit i, n only i, G isonnt n vry vrtx o G s positiv vn r. orollry to Torm ivs ritrion or trminin wn it is possil to in wlk rom on vrtx o rp to notr, pssin trou vry vrtx o t rp t lst on n vry o t rp xtly on. inition Lt G rp, n lt v n w two istint vrtis o G.nEulr tril rom v to w is squnojnt s n vrtis tt strts t v,ns t w,psss trou vry vrtx o G t lst on, n trvrss vry o G xtly on. opyrit 2010 n Lrnin. ll Rits Rsrv. My not opi, snn, or uplit, in wol or in prt. u to ltroni rits, som tir prty ontnt my supprss rom t ook n/or ptr(s). Eitoril rviw s m tt ny supprss ontnt os not mtrilly t t ovrll lrnin xprin. n Lrnin rsrvs t rit to rmov itionl ontnt t ny tim i susqunt rits rstritions rquir it.

12 10.2 Trils, Pts, n iruits 653 orollry Lt G rp, n lt v n w two istint vrtis o G. Tr is n Eulr pt rom v to w i, n only i, G is onnt, v n w v o r, n ll otr vrtis o G v positiv vn r. T proo o tisorollry is lt s n xris. Exmpl Finin n Eulr Tril T loor pln sown low is or ous tt is opn or puli viwin. Is it possil to in tril tt strts in room, ns in room, n psss trou vry intrior oorwy o t ous xtly on? I so, in su tril. F G I E J K Solution Lt t loor pln o t ous rprsnt y t rp low. G I F K E J E vrtx o tis rp s vn r xpt or n, o wisr 1. n y orollry , tr is n Eulr pt rom to. Onsu tril is G FEI EK J. Sir Wm. milton ( ) ttmnn/oris miltonin iruits Torm ompltly nswrs t ollowin qustion: Givn rp G, is it possil to in iruit or G in wi ll t s o G ppr xtly on? rlt qustion is tis: Givn rp G, is it possil to in iruit or G in wi ll t vrtis o G (xpt t irstn t lst) ppr xtly on? In 1859 t Iris mtmtiin Sir Willim Rown milton introu puzzl in t sp o oron (O-k--EE-ron). (Fiur ontins rwin o oron, wi is soliiur wit 12 intil pntonl s.) Fiur oron opyrit 2010 n Lrnin. ll Rits Rsrv. My not opi, snn, or uplit, in wol or in prt. u to ltroni rits, som tir prty ontnt my supprss rom t ook n/or ptr(s). Eitoril rviw s m tt ny supprss ontnt os not mtrilly t t ovrll lrnin xprin. n Lrnin rsrvs t rit to rmov itionl ontnt t ny tim i susqunt rits rstritions rquir it.

13 654 ptr 10 Grps n Trs E vrtx ws ll wit t nm o ity Lonon, Pris, on Kon, Nw York, n so on. T prolm milton pos ws to strt t on ity n tour t worl y visitin otr ity xtly on n rturnin to t strtin ity. On wy to solv t puzzl is to imin t sur o t oron strt out n li lt in t pln, s ollows: T iruit not wit lk lins is on solution. Not tt ltou vry ity is visit, mny s r omitt rom t iruit. (Mor iiult vrsions o t puzzl rquir tt rtin itis visit in rtin orr.) T ollowin inition ism in onor o milton. inition Givn rp G, miltonin iruit or G is simpl iruit tt inlus vry vrtx o G. Tt is, miltonin iruit or G is squn o jnt vrtis n istint s in wi vry vrtx o G pprs xtly on, xpt or t irstn t lst, wi r t sm. Not tt ltou n Eulr iruit or rp G must inlu vry vrtx o G, it my visit som vrtis mor tn on n n my not miltonin iruit. On t otr n, miltonin iruit or G os not n to inlu ll t s o G n n my not n Eulr iruit. spit t nloous-sounin initions o Eulr n miltonin iruits, t mtmtis o t two r vry irnt. Torm ivs simpl ritrion or trminin wtr ivn rp s n Eulr iruit. Unortuntly, tr is no nloous ritrion or trminin wtr ivn rp s miltonin iruit, nor is tr vn n iint loritm or inin su iruit. Tr is, owvr, simpl tniqu tt n us in mny ss to sow tt rp os not v miltonin iruit. Tis ollows rom t ollowin onsirtions: Suppos rp G wit t lst two vrtis s miltonin iruit ivn onrtly s : v v n 1 n v n. Sin is simpl iruit, ll t i r istint n ll t v j r istint xpt tt v 0 = v n.lt t surp o G tt is orm usin t vrtis n s o. n xmpl o su n issown low. is init y t lk lins. Not tt s t sm numr o s s it s vrtis sin ll its n s r istintnso r its n vrtis,,...,v n.lso, yinition o miltonin iruit, opyrit 2010 n Lrnin. ll Rits Rsrv. My not opi, snn, or uplit, in wol or in prt. u to ltroni rits, som tir prty ontnt my supprss rom t ook n/or ptr(s). Eitoril rviw s m tt ny supprss ontnt os not mtrilly t t ovrll lrnin xprin. n Lrnin rsrvs t rit to rmov itionl ontnt t ny tim i susqunt rits rstritions rquir it.

14 10.2 Trils, Pts, n iruits 655 vry vrtx o G is vrtx o,n isonntsinny two o its vrtis li on iruit. In ition, vry vrtx o s r 2. T rson or tis is tt tr r xtly two s inint on ny vrtx. Ts r i n i+1 or ny vrtx v i xpt v 0 = v n,n ty r 1 n n or v 0 (= v n ).Ts osrvtions v stlis t trut o t ollowin proposition in ll ss wr G s t lst two vrtis. Proposition I rp G s miltonin iruit, tn G s surp wit t ollowin proprtis: 1. ontins vry vrtx o G. 2. isonnt. 3. s t smnumr o s s vrtis. 4. Evry vrtx o s r 2. Not tt i G ontins only on vrtx n G s miltonin iruit, tn t iruit s t orm v v, wr v is t vrtx o G n is n inint on v.intiss, t surp onsistin o v n stisis onitions (1) (4) o Proposition Rll tt t ontrpositiv o sttmnt is loilly quivlnt to t sttmnt. T ontrpositiv o Proposition sys tt i rp G os not v surp wit proprtis (1) (4), tn G os not v miltonin iruit. Exmpl Sowin Tt Grp os Not v miltonin iruit Prov tt t rp G sown low os not v miltonin iruit. Solution I G s miltonin iruit, tn y Proposition , G s surp tt (1) ontins vry vrtx o G,(2) isonnt, (3) s t smnumr o s s vrtis, n (4) is su tt vry vrtx s r 2. Suppos su surp xists. In otr wors, suppos tr is onnt surp o G su tt s iv vrtis (,,,, ) n iv s n su tt vry vrtx o s r 2. Sin t r o in G is 4n vry vrtx o s r 2, two s inint on must rmov rom G to rt. E {, } nnot rmov us iit wr, vrtx woul v r lss tn 2 in. Similr rsonin sows tt s {, }, {, }, n {, } nnot rmov itr. It ollows tt t r o in must 4,wi ontrits t onition tt vry vrtx in s r 2 in. n nosu surp xists, nso G os not v miltonin iruit. T nxt xmpl illustrts typ o prolm known s trvlin slsmn prolm. It is vrition o t prolm o inin miltonin iruit or rp. opyrit 2010 n Lrnin. ll Rits Rsrv. My not opi, snn, or uplit, in wol or in prt. u to ltroni rits, som tir prty ontnt my supprss rom t ook n/or ptr(s). Eitoril rviw s m tt ny supprss ontnt os not mtrilly t t ovrll lrnin xprin. n Lrnin rsrvs t rit to rmov itionl ontnt t ny tim i susqunt rits rstritions rquir it.

15 656 ptr 10 Grps n Trs Exmpl Trvlin Slsmn Prolm Imin tt t rwin low is mp sowin our itis n t istns in kilomtrs twn tm.suppos tt slsmn must trvl to ity xtly on, strtin n nin in ity. Wi rout rom ity to ity will minimiz t totl istn tt must trvl? Solution Tis prolm n solv y writin ll possil miltonin iruits strtin n nin t n lultin t totl istn trvl or. Rout Totl istn (In Kilomtrs) = = = [ kwrs] 155 [ kwrs] 125 [ kwrs] Tus itr rout or ivs minimum totl istn o 125 kilomtrs. T nrl trvlin slsmn prolm involvs inin miltonin iruit to minimiz t totl istn trvl or n ritrry rp wit n vrtis in wi is mrk wit istn. On wy to solv t nrl prolm is to us t mto o Exmpl : Writ own ll miltonin iruits strtin n nin t prtiulr vrtx, omput t totl istn or, n pik on or wi tis totl is miniml. owvr, vn or mium-siz vlus o n tis mto is imprtil. For omplt rp wit 30 vrtis, tr woul (29!)/2 = miltonin iruits strtin n nin t prtiulr vrtx to k. Evn i iruit oul oun n its totl istn omput in just on nnoson, it woul rquir pproximtly yrs to inis t omputtion. t prsnt, tr is no known loritm or solvin t nrl trvlin slsmn prolm tt ismor iint. owvr, tr r iint loritms tt in prtty oo solutions tt is, iruits tt, wil not nssrily vin t lstpossil totl istns,vsmllr totl istns tn most otr miltonin iruits. Tst Yoursl 1. Lt G rp n lt v n w vrtis in G. () wlk rom v to w is. () tril rom v to w is. () pt rom v to w is. () los wlk is. () iruit is. () simpl iruit is. () trivil wlk is. () Vrtis v n w r onnt i, n only i,. opyrit 2010 n Lrnin. ll Rits Rsrv. My not opi, snn, or uplit, in wol or in prt. u to ltroni rits, som tir prty ontnt my supprss rom t ook n/or ptr(s). Eitoril rviw s m tt ny supprss ontnt os not mtrilly t t ovrll lrnin xprin. n Lrnin rsrvs t rit to rmov itionl ontnt t ny tim i susqunt rits rstritions rquir it.

16 10.2 Trils, Pts, n iruits rp isonnt i, n only i,. 3. Rmovin n rom iruit in rp os not. 4. n Eulr iruit in rp is. 5. rp s n Eulr iruit i, n only i,. 6. Givn vrtis v n w in rp, tr is n Eulr pt rom v to w i, n only i,. 7. miltonin iruit in rp is. 8. I rp G s miltonin iruit, tn G s surp wit t ollowin proprtis:,,, n. 9. trvlin slsmn prolm involvs inin tt minimizs t totl istn trvl or rp in wi is mrk wit istn. Exris St In t rp low, trmin wtr t ollowin wlks r trils, pts, los wlks, iruits, simpl iruits, or just wlks.. v v In t rp low, trmin wtr t ollowin wlks r trils, pts, los wlks, iruits, simpl iruits, or just wlks v v ow mny pts r tr rom to?. ow mny trils r tr rom to?. ow mny wlks r tr rom to? 5. onsir t ollowin rp ow mny pts r tr rom to?. ow mny trils r tr rom to?. ow mny wlks r tr rom to? 6. n wos rmovl isonnts t rp o wi it is prt is ll ri. Fin ll ris or o t ollowin rps.. 5. v v v 8 v 7 3. Lt G t rp 0 v5 v7 1 v 8 v 9 2 n onsir t wlk n tis wlk writtn unmiuously s? Wy?. n tis wlk writtn unmiuously s 1 2?Wy? 4. onsir t ollowin rp. 7. Givn ny positiv intr n, () in onnt rp wit n s su tt rmovl o just on isonnts t rp; () in onnt rp wit n s tt nnot isonnt y t rmovl o ny sinl opyrit 2010 n Lrnin. ll Rits Rsrv. My not opi, snn, or uplit, in wol or in prt. u to ltroni rits, som tir prty ontnt my supprss rom t ook n/or ptr(s). Eitoril rviw s m tt ny supprss ontnt os not mtrilly t t ovrll lrnin xprin. n Lrnin rsrvs t rit to rmov itionl ontnt t ny tim i susqunt rits rstritions rquir it.

17 658 ptr 10 Grps n Trs 8. Fin t numr o onnt omponnts or o t ollowin rps i 15. s t u v w r z y x. v u w z y x v 0. j i. 18. Is it possil to tk wlk roun t ity wos mp is sown low, strtin n nin t t sm point n rossin ri xtly on? I so, ow n tis on? E F 9. E o () () sris rp. In s nswr ys, no, or not nssrily to tis qustion: os t rp v n Eulr iruit? Justiyyour nswrs.. G is onnt rp wit iv vrtis o rs 2, 2, 3, 3,n 4.. G is onnt rp wit iv vrtis o rs 2, 2, 4, 4, n 6.. G is rp wit iv vrtis o rs 2, 2, 4, 4, n T solution or Exmpl sows rp or wi vry vrtx s vn r ut wi os not v n Eulr iruit. Giv notr xmpl o rp stisyin ts proprtis. 11. Is it possil or itizn o Könisr to mk tour o t ity n ross ri xtly twi? (S Fiur ) Wy? trmin wi o t rps in v Eulr iruits. I t rp os not v n Eulr iruit, xplin wy not. I it os v n Eulr iruit, sri on v 9 v 8 v 0 v3 Rivr For o t rps in 19 21, trmin wtr tr is n Eulr pt rom u to w. I tr is, in su pt. 19. v 7 w v 0 u E 20. u w v 7 opyrit 2010 n Lrnin. ll Rits Rsrv. My not opi, snn, or uplit, in wol or in prt. u to ltroni rits, som tir prty ontnt my supprss rom t ook n/or ptr(s). Eitoril rviw s m tt ny supprss ontnt os not mtrilly t t ovrll lrnin xprin. n Lrnin rsrvs t rit to rmov itionl ontnt t ny tim i susqunt rits rstritions rquir it.

18 10.2 Trils, Pts, n iruits v 7 u v 0 F E G w In in miltonin iruits or tos rps tt v tm. Explin wy t otr rps o not T ollowin is loor pln o ous. Is it possil to ntr t ous in room, trvl trou vry intrior oorwy o t ous xtly on, n xit out o room E?Iso, ow n tis on? G F E 30. v v 7 Fin miltonin iruits or o t rps in 23 n v 0 v 7 l k i Giv two xmpls o rps tt v Eulr iruits ut not miltonin iruits. Giv two xmpls o rps tt v miltonin iruits ut not Eulr iruits. Giv two xmpls o rps tt v iruits tt r ot Eulr iruits n miltonin iruits. Giv two xmpls o rps tt v Eulr iruits n miltonin iruits tt r not t sm. j Sow tt non o t rps in s miltonin iruit i j opyrit 2010 n Lrnin. ll Rits Rsrv. My not opi, snn, or uplit, in wol or in prt. u to ltroni rits, som tir prty ontnt my supprss rom t ook n/or ptr(s). Eitoril rviw s m tt ny supprss ontnt os not mtrilly t t ovrll lrnin xprin. n Lrnin rsrvs t rit to rmov itionl ontnt t ny tim i susqunt rits rstritions rquir it.

19 660 ptr 10 Grps n Trs 36. trvlr in Europ wnts to visit o t itis sown on t mp xtly on, strtin n nin in russls. T istn (in kilomtrs) twn pir o itis is ivn in t tl. Fin miltonin iruit tt minimizs t totl istn trvl. (Us t mp to nrrow t possil iruits own to just w. Tn us t tl to in t totl istn or o tos.) russls üsslor Luxmour Muni Pris , rlin russls üsslor Luxmour Pris Muni rlin russls üsslor Luxmour Muni Prov tt i wlk in rp ontins rpt, tn t wlk ontins rpt vrtx.. Explin ow it ollows rom prt () tt ny wlk wit no rpt vrtx s no rpt. 38. Prov Lmm (): I G is onnt rp, tn ny two istint vrtis o G n onnt y pt. 39. Prov Lmm (): I vrtis v n w r prt o iruit in rp G n on is rmov rom t iruit, tn tr still xists tril rom v to w in G. 40. rw pitur to illustrt Lmm (): I rp G is onnt n G ontins iruit, tn n o t iruit n rmov witout isonntin G. 41. Prov tt i tr is tril in rp G rom vrtx v to vrtx w, tn tr is tril rom w to v I rp ontins iruit tt strts n ns t vrtx v, os t rp ontin simpl iruit tt strts n ns t v?wy? 43. Prov tt i tr is iruit in rp tt strts n ns t vrtx v n i w is notr vrtx in t iruit, tn tr is iruit in t rp tt strts n ns t w. 44. Lt G onnt rp, n lt ny iruit in G tt os not ontin vry vrtx o. LtG t surp otin y rmovin ll t s o rom G n lso ny vrtis tt om isolt wn t s o r rmov. Prov tt tr xists vrtx v su tt v is in ot n G. 45. Prov tt ny rp wit n Eulr iruit is onnt. 46. Prov orollry For wt vlus o n os t omplt rp K n wit n vrtis v () n Eulr iruit? () miltonin iruit? Justiyyour nswrs. For wt vlus o m n n os t omplt iprtit rp on (m, n) vrtis v () n Eulr iruit? () miltonin iruit? Justiyyour nswrs. Wt is t mximum numr o s simpl isonnt rp wit n vrtis n v? Prov your nswr. Sow tt rp is iprtit i, n only i, it os not v iruit wit n o numr o s. (S xris 37 o Stion 10.1 or t inition o iprtit rp.) nswrs or Tst Yoursl 1. () init ltrntin squn ojnt vrtis n s o G () wlk tt os not ontin rpt () tril tt os not ontin rpt vrtx () wlk tt strts n ns t t sm vrtx () los wlk tt ontins t lst on n os not ontin rpt () iruit tt os not v ny rpt vrtx otr tn t irst n t lst () wlk onsistin o sinl vrtx n no () tr is wlk rom v to w 2. ivn ny two vrtis in t rp, tr is wlk rom on to t otr 3. isonnt t rp 4. iruit tt ontins vry vrtx n vry o t rp 5. t rp is onnt, n vry vrtx s positiv, vn r 6. t rp is onnt, v n w v o r, n ll otr vrtis v positiv vn r 7. simpl iruit tt inlus vry vrtx o t rp 8. ontins vry vrtx o G; isonnt; s t sm numr o s s vrtis;vry vrtx o s r 2 9. miltonin iruit opyrit 2010 n Lrnin. ll Rits Rsrv. My not opi, snn, or uplit, in wol or in prt. u to ltroni rits, som tir prty ontnt my supprss rom t ook n/or ptr(s). Eitoril rviw s m tt ny supprss ontnt os not mtrilly t t ovrll lrnin xprin. n Lrnin rsrvs t rit to rmov itionl ontnt t ny tim i susqunt rits rstritions rquir it.

MAT3707. Tutorial letter 201/1/2017 DISCRETE MATHEMATICS: COMBINATORICS. Semester 1. Department of Mathematical Sciences MAT3707/201/1/2017

MAT3707. Tutorial letter 201/1/2017 DISCRETE MATHEMATICS: COMBINATORICS. Semester 1. Department of Mathematical Sciences MAT3707/201/1/2017 MAT3707/201/1/2017 Tutoril lttr 201/1/2017 DISCRETE MATHEMATICS: COMBINATORICS MAT3707 Smstr 1 Dprtmnt o Mtmtil Sins SOLUTIONS TO ASSIGNMENT 01 BARCODE Din tomorrow. univrsity o sout ri SOLUTIONS TO ASSIGNMENT

More information

Grade 7/8 Math Circles March 4/5, Graph Theory I- Solutions

Grade 7/8 Math Circles March 4/5, Graph Theory I- Solutions ulty o Mtmtis Wtrloo, Ontrio N ntr or ution in Mtmtis n omputin r / Mt irls Mr /, 0 rp Tory - Solutions * inits lln qustion. Tr t ollowin wlks on t rp low. or on, stt wtr it is pt? ow o you know? () n

More information

Complete Solutions for MATH 3012 Quiz 2, October 25, 2011, WTT

Complete Solutions for MATH 3012 Quiz 2, October 25, 2011, WTT Complt Solutions or MATH 012 Quiz 2, Otor 25, 2011, WTT Not. T nswrs ivn r r mor omplt tn is xpt on n tul xm. It is intn tt t mor omprnsiv solutions prsnt r will vlul to stunts in stuyin or t inl xm. In

More information

learning objectives learn what graphs are in mathematical terms learn how to represent graphs in computers learn about typical graph algorithms

learning objectives learn what graphs are in mathematical terms learn how to represent graphs in computers learn about typical graph algorithms rp loritms lrnin ojtivs loritms your sotwr systm sotwr rwr lrn wt rps r in mtmtil trms lrn ow to rprsnt rps in omputrs lrn out typil rp loritms wy rps? intuitivly, rp is orm y vrtis n s twn vrtis rps r

More information

Paths. Connectivity. Euler and Hamilton Paths. Planar graphs.

Paths. Connectivity. Euler and Hamilton Paths. Planar graphs. Pths.. Eulr n Hmilton Pths.. Pth D. A pth rom s to t is squn o gs {x 0, x 1 }, {x 1, x 2 },... {x n 1, x n }, whr x 0 = s, n x n = t. D. Th lngth o pth is th numr o gs in it. {, } {, } {, } {, } {, } {,

More information

Cycles and Simple Cycles. Paths and Simple Paths. Trees. Problem: There is No Completely Standard Terminology!

Cycles and Simple Cycles. Paths and Simple Paths. Trees. Problem: There is No Completely Standard Terminology! Outlin Computr Sin 331, Spnnin, n Surphs Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #30 1 Introution 2 3 Dinition 4 Spnnin 5 6 Mik Joson (Univrsity o Clry) Computr Sin 331 Ltur #30 1 / 20 Mik

More information

16.unified Introduction to Computers and Programming. SOLUTIONS to Examination 4/30/04 9:05am - 10:00am

16.unified Introduction to Computers and Programming. SOLUTIONS to Examination 4/30/04 9:05am - 10:00am 16.unii Introution to Computrs n Prormmin SOLUTIONS to Exmintion /30/0 9:05m - 10:00m Pro. I. Kristin Lunqvist Sprin 00 Grin Stion: Qustion 1 (5) Qustion (15) Qustion 3 (10) Qustion (35) Qustion 5 (10)

More information

d e c b a d c b a d e c b a a c a d c c e b

d e c b a d c b a d e c b a a c a d c c e b FLAT PEYOTE STITCH Bin y mkin stoppr -- sw trou n pull it lon t tr until it is out 6 rom t n. Sw trou t in witout splittin t tr. You soul l to sli it up n own t tr ut it will sty in pl wn lt lon. Evn-Count

More information

Tangram Fractions Overview: Students will analyze standard and nonstandard

Tangram Fractions Overview: Students will analyze standard and nonstandard ACTIVITY 1 Mtrils: Stunt opis o tnrm mstrs trnsprnis o tnrm mstrs sissors PROCEDURE Skills: Dsriin n nmin polyons Stuyin onrun Comprin rtions Tnrm Frtions Ovrviw: Stunts will nlyz stnr n nonstnr tnrms

More information

The University of Sydney MATH 2009

The University of Sydney MATH 2009 T Unvrsty o Syny MATH 2009 APH THEOY Tutorl 7 Solutons 2004 1. Lt t sonnt plnr rp sown. Drw ts ul, n t ul o t ul ( ). Sow tt s sonnt plnr rp, tn s onnt. Du tt ( ) s not somorp to. ( ) A onnt rp s on n

More information

12/3/12. Outline. Part 10. Graphs. Circuits. Euler paths/circuits. Euler s bridge problem (Bridges of Konigsberg Problem)

12/3/12. Outline. Part 10. Graphs. Circuits. Euler paths/circuits. Euler s bridge problem (Bridges of Konigsberg Problem) 12/3/12 Outlin Prt 10. Grphs CS 200 Algorithms n Dt Struturs Introution Trminology Implmnting Grphs Grph Trvrsls Topologil Sorting Shortst Pths Spnning Trs Minimum Spnning Trs Ciruits 1 Ciruits Cyl 2 Eulr

More information

5/9/13. Part 10. Graphs. Outline. Circuits. Introduction Terminology Implementing Graphs

5/9/13. Part 10. Graphs. Outline. Circuits. Introduction Terminology Implementing Graphs Prt 10. Grphs CS 200 Algorithms n Dt Struturs 1 Introution Trminology Implmnting Grphs Outlin Grph Trvrsls Topologil Sorting Shortst Pths Spnning Trs Minimum Spnning Trs Ciruits 2 Ciruits Cyl A spil yl

More information

Present state Next state Q + M N

Present state Next state Q + M N Qustion 1. An M-N lip-lop works s ollows: I MN=00, th nxt stt o th lip lop is 0. I MN=01, th nxt stt o th lip-lop is th sm s th prsnt stt I MN=10, th nxt stt o th lip-lop is th omplmnt o th prsnt stt I

More information

0.1. Exercise 1: the distances between four points in a graph

0.1. Exercise 1: the distances between four points in a graph Mth 707 Spring 2017 (Drij Grinrg): mitrm 3 pg 1 Mth 707 Spring 2017 (Drij Grinrg): mitrm 3 u: W, 3 My 2017, in lss or y mil (grinr@umn.u) or lss S th wsit or rlvnt mtril. Rsults provn in th nots, or in

More information

QUESTIONS BEGIN HERE!

QUESTIONS BEGIN HERE! Points miss: Stunt's Nm: Totl sor: /100 points Est Tnnss Stt Univrsity Dprtmnt of Computr n Informtion Sins CSCI 710 (Trnoff) Disrt Struturs TEST for Fll Smstr, 00 R this for strtin! This tst is los ook

More information

, each of which is a tree, and whose roots r 1. , respectively, are children of r. Data Structures & File Management

, each of which is a tree, and whose roots r 1. , respectively, are children of r. Data Structures & File Management nrl tr T is init st o on or mor nos suh tht thr is on sint no r, ll th root o T, n th rminin nos r prtition into n isjoint susts T, T,, T n, h o whih is tr, n whos roots r, r,, r n, rsptivly, r hilrn o

More information

CSE 373. Graphs 1: Concepts, Depth/Breadth-First Search reading: Weiss Ch. 9. slides created by Marty Stepp

CSE 373. Graphs 1: Concepts, Depth/Breadth-First Search reading: Weiss Ch. 9. slides created by Marty Stepp CSE 373 Grphs 1: Conpts, Dpth/Brth-First Srh ring: Wiss Ch. 9 slis rt y Mrty Stpp http://www.s.wshington.u/373/ Univrsity o Wshington, ll rights rsrv. 1 Wht is grph? 56 Tokyo Sttl Soul 128 16 30 181 140

More information

CS 103 BFS Alorithm. Mark Redekopp

CS 103 BFS Alorithm. Mark Redekopp CS 3 BFS Aloritm Mrk Rkopp Brt-First Sr (BFS) HIGHLIGHTED ALGORITHM 3 Pt Plnnin W'v sn BFS in t ontxt o inin t sortst pt trou mz? S?? 4 Pt Plnnin W xplor t 4 niors s on irtion 3 3 3 S 3 3 3 3 3 F I you

More information

Math 166 Week in Review 2 Sections 1.1b, 1.2, 1.3, & 1.4

Math 166 Week in Review 2 Sections 1.1b, 1.2, 1.3, & 1.4 Mt 166 WIR, Sprin 2012, Bnjmin urisp Mt 166 Wk in Rviw 2 Stions 1.1, 1.2, 1.3, & 1.4 1. S t pproprit rions in Vnn irm tt orrspon to o t ollowin sts. () (B ) B () ( ) B B () (B ) B 1 Mt 166 WIR, Sprin 2012,

More information

QUESTIONS BEGIN HERE!

QUESTIONS BEGIN HERE! Points miss: Stunt's Nm: Totl sor: /100 points Est Tnnss Stt Univrsity Dprtmnt o Computr n Inormtion Sins CSCI 2710 (Trno) Disrt Struturs TEST or Sprin Smstr, 2005 R this or strtin! This tst is los ook

More information

An undirected graph G = (V, E) V a set of vertices E a set of unordered edges (v,w) where v, w in V

An undirected graph G = (V, E) V a set of vertices E a set of unordered edges (v,w) where v, w in V Unirt Grphs An unirt grph G = (V, E) V st o vrtis E st o unorr gs (v,w) whr v, w in V USE: to mol symmtri rltionships twn ntitis vrtis v n w r jnt i thr is n g (v,w) [or (w,v)] th g (v,w) is inint upon

More information

CSE 373: More on graphs; DFS and BFS. Michael Lee Wednesday, Feb 14, 2018

CSE 373: More on graphs; DFS and BFS. Michael Lee Wednesday, Feb 14, 2018 CSE 373: Mor on grphs; DFS n BFS Mihl L Wnsy, F 14, 2018 1 Wrmup Wrmup: Disuss with your nighor: Rmin your nighor: wht is simpl grph? Suppos w hv simpl, irt grph with x nos. Wht is th mximum numr of gs

More information

Weighted Graphs. Weighted graphs may be either directed or undirected.

Weighted Graphs. Weighted graphs may be either directed or undirected. 1 In mny ppltons, o rp s n ssot numrl vlu, ll wt. Usully, t wts r nonntv ntrs. Wt rps my tr rt or unrt. T wt o n s otn rrr to s t "ost" o t. In ppltons, t wt my msur o t lnt o rout, t pty o ln, t nry rqur

More information

Lecture 20: Minimum Spanning Trees (CLRS 23)

Lecture 20: Minimum Spanning Trees (CLRS 23) Ltur 0: Mnmum Spnnn Trs (CLRS 3) Jun, 00 Grps Lst tm w n (wt) rps (unrt/rt) n ntrou s rp voulry (vrtx,, r, pt, onnt omponnts,... ) W lso suss jny lst n jny mtrx rprsntton W wll us jny lst rprsntton unlss

More information

OpenMx Matrices and Operators

OpenMx Matrices and Operators OpnMx Mtris n Oprtors Sr Mln Mtris: t uilin loks Mny typs? Dnots r lmnt mxmtrix( typ= Zro", nrow=, nol=, nm="" ) mxmtrix( typ= Unit", nrow=, nol=, nm="" ) mxmtrix( typ= Int", nrow=, nol=, nm="" ) mxmtrix(

More information

Module graph.py. 1 Introduction. 2 Graph basics. 3 Module graph.py. 3.1 Objects. CS 231 Naomi Nishimura

Module graph.py. 1 Introduction. 2 Graph basics. 3 Module graph.py. 3.1 Objects. CS 231 Naomi Nishimura Moul grph.py CS 231 Nomi Nishimur 1 Introution Just lik th Python list n th Python itionry provi wys of storing, ssing, n moifying t, grph n viw s wy of storing, ssing, n moifying t. Bus Python os not

More information

Outline. Circuits. Euler paths/circuits 4/25/12. Part 10. Graphs. Euler s bridge problem (Bridges of Konigsberg Problem)

Outline. Circuits. Euler paths/circuits 4/25/12. Part 10. Graphs. Euler s bridge problem (Bridges of Konigsberg Problem) 4/25/12 Outlin Prt 10. Grphs CS 200 Algorithms n Dt Struturs Introution Trminology Implmnting Grphs Grph Trvrsls Topologil Sorting Shortst Pths Spnning Trs Minimum Spnning Trs Ciruits 1 2 Eulr s rig prolm

More information

(4, 2)-choosability of planar graphs with forbidden structures

(4, 2)-choosability of planar graphs with forbidden structures 1 (4, )-oosility o plnr rps wit orin struturs 4 5 Znr Brikkyzy 1 Cristopr Cox Mil Diryko 1 Kirstn Honson 1 Moit Kumt 1 Brnr Liiký 1, Ky Mssrsmit 1 Kvin Moss 1 Ktln Nowk 1 Kvin F. Plmowski 1 Drrik Stol

More information

Depth First Search. Yufei Tao. Department of Computer Science and Engineering Chinese University of Hong Kong

Depth First Search. Yufei Tao. Department of Computer Science and Engineering Chinese University of Hong Kong Dprtmnt o Computr Sn n Ennrn Cns Unvrsty o Hon Kon W v lry lrn rt rst sr (BFS). Toy, w wll suss ts sstr vrson : t pt rst sr (DFS) lortm. Our susson wll on n ous on rt rps, us t xtnson to unrt rps s strtorwr.

More information

CS 461, Lecture 17. Today s Outline. Example Run

CS 461, Lecture 17. Today s Outline. Example Run Prim s Algorithm CS 461, Ltur 17 Jr Si Univrsity o Nw Mxio In Prim s lgorithm, th st A mintin y th lgorithm orms singl tr. Th tr strts rom n ritrry root vrtx n grows until it spns ll th vrtis in V At h

More information

The University of Sydney MATH2969/2069. Graph Theory Tutorial 5 (Week 12) Solutions 2008

The University of Sydney MATH2969/2069. Graph Theory Tutorial 5 (Week 12) Solutions 2008 Th Univrsity o Syny MATH2969/2069 Grph Thory Tutoril 5 (Wk 12) Solutions 2008 1. (i) Lt G th isonnt plnr grph shown. Drw its ul G, n th ul o th ul (G ). (ii) Show tht i G is isonnt plnr grph, thn G is

More information

1 Introduction to Modulo 7 Arithmetic

1 Introduction to Modulo 7 Arithmetic 1 Introution to Moulo 7 Arithmti Bor w try our hn t solvin som hr Moulr KnKns, lt s tk los look t on moulr rithmti, mo 7 rithmti. You ll s in this sminr tht rithmti moulo prim is quit irnt rom th ons w

More information

ECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS

ECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS C 24 - COMBINATIONAL BUILDING BLOCKS - INVST 3 DCODS AND NCODS FALL 23 AP FLZ To o "wll" on this invstition you must not only t th riht nswrs ut must lso o nt, omplt n onis writups tht mk ovious wht h

More information

b. How many ternary words of length 23 with eight 0 s, nine 1 s and six 2 s?

b. How many ternary words of length 23 with eight 0 s, nine 1 s and six 2 s? MATH 3012 Finl Exm, My 4, 2006, WTT Stunt Nm n ID Numr 1. All our prts o this prolm r onrn with trnry strings o lngth n, i.., wors o lngth n with lttrs rom th lpht {0, 1, 2}.. How mny trnry wors o lngth

More information

Algorithmic and NP-Completeness Aspects of a Total Lict Domination Number of a Graph

Algorithmic and NP-Completeness Aspects of a Total Lict Domination Number of a Graph Intrntionl J.Mth. Comin. Vol.1(2014), 80-86 Algorithmi n NP-Compltnss Aspts of Totl Lit Domintion Numr of Grph Girish.V.R. (PES Institut of Thnology(South Cmpus), Bnglor, Krntk Stt, Ini) P.Ush (Dprtmnt

More information

Math 61 : Discrete Structures Final Exam Instructor: Ciprian Manolescu. You have 180 minutes.

Math 61 : Discrete Structures Final Exam Instructor: Ciprian Manolescu. You have 180 minutes. Nm: UCA ID Numr: Stion lttr: th 61 : Disrt Struturs Finl Exm Instrutor: Ciprin nolsu You hv 180 minuts. No ooks, nots or lultors r llow. Do not us your own srth ppr. 1. (2 points h) Tru/Fls: Cirl th right

More information

DFA Minimization. DFA minimization: the idea. Not in Sipser. Background: Questions: Assignments: Previously: Today: Then:

DFA Minimization. DFA minimization: the idea. Not in Sipser. Background: Questions: Assignments: Previously: Today: Then: Assinmnts: DFA Minimiztion CMPU 24 Lnu Tory n Computtion Fll 28 Assinmnt 3 out toy. Prviously: Computtionl mols or t rulr lnus: DFAs, NFAs, rulr xprssions. Toy: How o w in t miniml DFA or lnu? Tis is t

More information

Outline. 1 Introduction. 2 Min-Cost Spanning Trees. 4 Example

Outline. 1 Introduction. 2 Min-Cost Spanning Trees. 4 Example Outlin Computr Sin 33 Computtion o Minimum-Cost Spnnin Trs Prim's Alorithm Introution Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #33 3 Alorithm Gnrl Constrution Mik Joson (Univrsity o Clry)

More information

Exam 1 Solution. CS 542 Advanced Data Structures and Algorithms 2/14/2013

Exam 1 Solution. CS 542 Advanced Data Structures and Algorithms 2/14/2013 CS Avn Dt Struturs n Algorithms Exm Solution Jon Turnr //. ( points) Suppos you r givn grph G=(V,E) with g wights w() n minimum spnning tr T o G. Now, suppos nw g {u,v} is to G. Dsri (in wors) mtho or

More information

Graph Algorithms and Combinatorial Optimization Presenters: Benjamin Ferrell and K. Alex Mills May 7th, 2014

Graph Algorithms and Combinatorial Optimization Presenters: Benjamin Ferrell and K. Alex Mills May 7th, 2014 Grp Aloritms n Comintoril Optimiztion Dr. R. Cnrskrn Prsntrs: Bnjmin Frrll n K. Alx Mills My 7t, 0 Mtroi Intrstion In ts ltur nots, w mk us o som unonvntionl nottion or st union n irn to kp tins lnr. In

More information

Seven-Segment Display Driver

Seven-Segment Display Driver 7-Smnt Disply Drivr, Ron s in 7-Smnt Disply Drivr, Ron s in Prolm 62. 00 0 0 00 0000 000 00 000 0 000 00 0 00 00 0 0 0 000 00 0 00 BCD Diits in inry Dsin Drivr Loi 4 inputs, 7 outputs 7 mps, h with 6 on

More information

Outline. Computer Science 331. Computation of Min-Cost Spanning Trees. Costs of Spanning Trees in Weighted Graphs

Outline. Computer Science 331. Computation of Min-Cost Spanning Trees. Costs of Spanning Trees in Weighted Graphs Outlin Computr Sin 33 Computtion o Minimum-Cost Spnnin Trs Prim s Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #34 Introution Min-Cost Spnnin Trs 3 Gnrl Constrution 4 5 Trmintion n Eiiny 6 Aitionl

More information

Graphs. Graphs. Graphs: Basic Terminology. Directed Graphs. Dr Papalaskari 1

Graphs. Graphs. Graphs: Basic Terminology. Directed Graphs. Dr Papalaskari 1 CSC 00 Disrt Struturs : Introuon to Grph Thory Grphs Grphs CSC 00 Disrt Struturs Villnov Univrsity Grphs r isrt struturs onsisng o vrs n gs tht onnt ths vrs. Grphs n us to mol: omputr systms/ntworks mthml

More information

# 1 ' 10 ' 100. Decimal point = 4 hundred. = 6 tens (or sixty) = 5 ones (or five) = 2 tenths. = 7 hundredths.

# 1 ' 10 ' 100. Decimal point = 4 hundred. = 6 tens (or sixty) = 5 ones (or five) = 2 tenths. = 7 hundredths. How os it work? Pl vlu o imls rprsnt prts o whol numr or ojt # 0 000 Tns o thousns # 000 # 00 Thousns Hunrs Tns Ons # 0 Diml point st iml pl: ' 0 # 0 on tnth n iml pl: ' 0 # 00 on hunrth r iml pl: ' 0

More information

Indices. Indices. Curriculum Ready ACMNA: 209, 210, 212,

Indices. Indices. Curriculum Ready ACMNA: 209, 210, 212, Inis Inis Curriulum Ry ACMNA: 09, 0,, 6 www.mtltis.om Inis INDICES Inis is t plurl or inx. An inx is us to writ prouts o numrs or pronumrls sily. For xmpl is tully sortr wy o writin #. T is t inx. Anotr

More information

Divided. diamonds. Mimic the look of facets in a bracelet that s deceptively deep RIGHT-ANGLE WEAVE. designed by Peggy Brinkman Matteliano

Divided. diamonds. Mimic the look of facets in a bracelet that s deceptively deep RIGHT-ANGLE WEAVE. designed by Peggy Brinkman Matteliano RIGHT-ANGLE WEAVE Dv mons Mm t look o ts n rlt tt s ptvly p sn y Py Brnkmn Mttlno Dv your mons nto trnls o two or our olors. FCT-SCON0216_BNB66 2012 Klm Pulsn Co. Ts mtrl my not rprou n ny orm wtout prmsson

More information

EE1000 Project 4 Digital Volt Meter

EE1000 Project 4 Digital Volt Meter Ovrviw EE1000 Projt 4 Diitl Volt Mtr In this projt, w mk vi tht n msur volts in th rn o 0 to 4 Volts with on iit o ury. Th input is n nlo volt n th output is sinl 7-smnt iit tht tlls us wht tht input s

More information

Graphs. CSC 1300 Discrete Structures Villanova University. Villanova CSC Dr Papalaskari

Graphs. CSC 1300 Discrete Structures Villanova University. Villanova CSC Dr Papalaskari Grphs CSC 1300 Disrt Struturs Villnov Univrsity Grphs Grphs r isrt struturs onsis?ng of vr?s n gs tht onnt ths vr?s. Grphs n us to mol: omputr systms/ntworks mthm?l rl?ons logi iruit lyout jos/prosss f

More information

CS 241 Analysis of Algorithms

CS 241 Analysis of Algorithms CS 241 Anlysis o Algorithms Prossor Eri Aron Ltur T Th 9:00m Ltur Mting Lotion: OLB 205 Businss HW6 u lry HW7 out tr Thnksgiving Ring: Ch. 22.1-22.3 1 Grphs (S S. B.4) Grphs ommonly rprsnt onntions mong

More information

In which direction do compass needles always align? Why?

In which direction do compass needles always align? Why? AQA Trloy Unt 6.7 Mntsm n Eltromntsm - Hr 1 Complt t p ll: Mnt or s typ o or n t s stronst t t o t mnt. Tr r two typs o mnt pol: n. Wrt wt woul ppn twn t pols n o t mnt ntrtons low: Drw t mnt l lns on

More information

1. Determine whether or not the following binary relations are equivalence relations. Be sure to justify your answers.

1. Determine whether or not the following binary relations are equivalence relations. Be sure to justify your answers. Mth 0 Exm - Prti Prolm Solutions. Dtrmin whthr or not th ollowing inry rltions r quivln rltions. B sur to justiy your nswrs. () {(0,0),(0,),(0,),(,),(,),(,),(,),(,0),(,),(,),(,0),(,),(.)} on th st A =

More information

5/1/2018. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees

5/1/2018. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees /1/018 W usully no strns y ssnn -lnt os to ll rtrs n t lpt (or mpl, 8-t on n ASCII). Howvr, rnt rtrs our wt rnt rquns, w n sv mmory n ru trnsmttl tm y usn vrl-lnt non. T s to ssn sortr os to rtrs tt our

More information

Decimals DECIMALS.

Decimals DECIMALS. Dimls DECIMALS www.mthltis.o.uk ow os it work? Solutions Dimls P qustions Pl vlu o imls 0 000 00 000 0 000 00 0 000 00 0 000 00 0 000 tnths or 0 thousnths or 000 hunrths or 00 hunrths or 00 0 tn thousnths

More information

CSC Design and Analysis of Algorithms. Example: Change-Making Problem

CSC Design and Analysis of Algorithms. Example: Change-Making Problem CSC 801- Dsign n Anlysis of Algorithms Ltur 11 Gry Thniqu Exmpl: Chng-Mking Prolm Givn unlimit mounts of oins of nomintions 1 > > m, giv hng for mount n with th lst numr of oins Exmpl: 1 = 25, 2 =10, =

More information

Spanning Trees. BFS, DFS spanning tree Minimum spanning tree. March 28, 2018 Cinda Heeren / Geoffrey Tien 1

Spanning Trees. BFS, DFS spanning tree Minimum spanning tree. March 28, 2018 Cinda Heeren / Geoffrey Tien 1 Spnnn Trs BFS, DFS spnnn tr Mnmum spnnn tr Mr 28, 2018 Cn Hrn / Gory Tn 1 Dpt-rst sr Vsts vrts lon snl pt s r s t n o, n tn ktrks to t rst junton n rsums own notr pt Mr 28, 2018 Cn Hrn / Gory Tn 2 Dpt-rst

More information

(2) If we multiplied a row of B by λ, then the value is also multiplied by λ(here lambda could be 0). namely

(2) If we multiplied a row of B by λ, then the value is also multiplied by λ(here lambda could be 0). namely . DETERMINANT.. Dtrminnt. Introution:I you think row vtor o mtrix s oorint o vtors in sp, thn th gomtri mning o th rnk o th mtrix is th imnsion o th prlllppi spnn y thm. But w r not only r out th imnsion,

More information

Constructive Geometric Constraint Solving

Constructive Geometric Constraint Solving Construtiv Gomtri Constrint Solving Antoni Soto i Rir Dprtmnt Llngutgs i Sistms Inormàtis Univrsitt Politèni Ctluny Brlon, Sptmr 2002 CGCS p.1/37 Prliminris CGCS p.2/37 Gomtri onstrint prolm C 2 D L BC

More information

5/7/13. Part 10. Graphs. Theorem Theorem Graphs Describing Precedence. Outline. Theorem 10-1: The Handshaking Theorem

5/7/13. Part 10. Graphs. Theorem Theorem Graphs Describing Precedence. Outline. Theorem 10-1: The Handshaking Theorem Thorm 10-1: Th Hnshkin Thorm Lt G=(V,E) n unirt rph. Thn Prt 10. Grphs CS 200 Alorithms n Dt Struturs v V (v) = 2 E How mny s r thr in rph with 10 vrtis h of r six? 10 * 6 /2= 30 1 Thorm 10-2 An unirt

More information

Improving Union. Implementation. Union-by-size Code. Union-by-Size Find Analysis. Path Compression! Improving Find find(e)

Improving Union. Implementation. Union-by-size Code. Union-by-Size Find Analysis. Path Compression! Improving Find find(e) POW CSE 36: Dt Struturs Top #10 T Dynm (Equvln) Duo: Unon-y-Sz & Pt Comprsson Wk!! Luk MDowll Summr Qurtr 003 M! ZING Wt s Goo Mz? Mz Construton lortm Gvn: ollton o rooms V Conntons twn t rooms (ntlly

More information

Solutions for HW11. Exercise 34. (a) Use the recurrence relation t(g) = t(g e) + t(g/e) to count the number of spanning trees of v 1

Solutions for HW11. Exercise 34. (a) Use the recurrence relation t(g) = t(g e) + t(g/e) to count the number of spanning trees of v 1 Solutions for HW Exris. () Us th rurrn rltion t(g) = t(g ) + t(g/) to ount th numr of spnning trs of v v v u u u Rmmr to kp multipl gs!! First rrw G so tht non of th gs ross: v u v Rursing on = (v, u ):

More information

VLSI Testing Assignment 2

VLSI Testing Assignment 2 1. 5-vlu D-clculus trut tbl or t XOR unction: XOR 0 1 X D ~D 0 0 1 X D ~D 1 1 0 X ~D D X X X X X X D D ~D X 0 1 ~D ~D D X 1 0 Tbl 1: 5-vlu D-clculus Trut Tbl or t XOR Function Sinc 2-input XOR t wors s

More information

CMPS 2200 Fall Graphs. Carola Wenk. Slides courtesy of Charles Leiserson with changes and additions by Carola Wenk

CMPS 2200 Fall Graphs. Carola Wenk. Slides courtesy of Charles Leiserson with changes and additions by Carola Wenk CMPS 2200 Fll 2017 Grps Crol Wnk Sls ourtsy o Crls Lsrson wt ns n tons y Crol Wnk 10/23/17 CMPS 2200 Intro. to Alortms 1 Grps Dnton. A rt rp (rp) G = (V, E) s n orr pr onsstn o st V o vrts (snulr: vrtx),

More information

Announcements. Not graphs. These are Graphs. Applications of Graphs. Graph Definitions. Graphs & Graph Algorithms. A6 released today: Risk

Announcements. Not graphs. These are Graphs. Applications of Graphs. Graph Definitions. Graphs & Graph Algorithms. A6 released today: Risk Grphs & Grph Algorithms Ltur CS Spring 6 Announmnts A6 rls toy: Risk Strt signing with your prtnr sp Prlim usy Not grphs hs r Grphs K 5 K, =...not th kin w mn, nywy Applitions o Grphs Communition ntworks

More information

Planar Upward Drawings

Planar Upward Drawings C.S. 252 Pro. Rorto Tmssi Computtionl Gomtry Sm. II, 1992 1993 Dt: My 3, 1993 Sri: Shmsi Moussvi Plnr Upwr Drwings 1 Thorm: G is yli i n only i it hs upwr rwing. Proo: 1. An upwr rwing is yli. Follow th

More information

(Minimum) Spanning Trees

(Minimum) Spanning Trees (Mnmum) Spnnn Trs Spnnn trs Kruskl's lortm Novmr 23, 2017 Cn Hrn / Gory Tn 1 Spnnn trs Gvn G = V, E, spnnn tr o G s onnt surp o G wt xtly V 1 s mnml sust o s tt onnts ll t vrts o G G = Spnnn trs Novmr

More information

CS September 2018

CS September 2018 Loil los Distriut Systms 06. Loil los Assin squn numrs to msss All ooprtin prosss n r on orr o vnts vs. physil los: rport tim o y Assum no ntrl tim sour Eh systm mintins its own lol lo No totl orrin o

More information

CSE 373: AVL trees. Warmup: Warmup. Interlude: Exploring the balance invariant. AVL Trees: Invariants. AVL tree invariants review

CSE 373: AVL trees. Warmup: Warmup. Interlude: Exploring the balance invariant. AVL Trees: Invariants. AVL tree invariants review rmup CSE 7: AVL trs rmup: ht is n invrint? Mihl L Friy, Jn 9, 0 ht r th AVL tr invrints, xtly? Disuss with your nighor. AVL Trs: Invrints Intrlu: Exploring th ln invrint Cor i: xtr invrint to BSTs tht

More information

Section 10.4 Connectivity (up to paths and isomorphism, not including)

Section 10.4 Connectivity (up to paths and isomorphism, not including) Toy w will isuss two stions: Stion 10.3 Rprsnting Grphs n Grph Isomorphism Stion 10.4 Conntivity (up to pths n isomorphism, not inluing) 1 10.3 Rprsnting Grphs n Grph Isomorphism Whn w r working on n lgorithm

More information

Outline. Binary Tree

Outline. Binary Tree Outlin Similrity Srh Th Binry Brnh Distn Nikolus Austn nikolus.ustn@s..t Dpt. o Computr Sins Univrsity o Slzur http://rsrh.uni-slzur.t 1 Binry Brnh Distn Binry Rprsnttion o Tr Binry Brnhs Lowr Boun or

More information

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)} Introution Computr Sin & Enginring 423/823 Dsign n Anlysis of Algorithms Ltur 03 Elmntry Grph Algorithms (Chptr 22) Stphn Sott (Apt from Vinohnrn N. Vriym) I Grphs r strt t typs tht r pplil to numrous

More information

CMSC 451: Lecture 4 Bridges and 2-Edge Connectivity Thursday, Sep 7, 2017

CMSC 451: Lecture 4 Bridges and 2-Edge Connectivity Thursday, Sep 7, 2017 Rn: Not ovr n or rns. CMSC 451: Ltr 4 Brs n 2-E Conntvty Trsy, Sp 7, 2017 Hr-Orr Grp Conntvty: (T ollown mtrl ppls only to nrt rps!) Lt G = (V, E) n onnt nrt rp. W otn ssm tt or rps r onnt, t somtms t

More information

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)} s s of s Computr Sin & Enginring 423/823 Dsign n Anlysis of Ltur 03 (Chptr 22) Stphn Sott (Apt from Vinohnrn N. Vriym) s of s s r strt t typs tht r pplil to numrous prolms Cn ptur ntitis, rltionships twn

More information

c 2009 Society for Industrial and Applied Mathematics

c 2009 Society for Industrial and Applied Mathematics SIAM J. DISCRETE MATH. Vol. 0, No. 0, pp. 000 000 2009 Soity or Inustril n Appli Mtmtis THE TWO-COLORING NUMBER AND DEGENERATE COLORINGS OF PLANAR GRAPHS HAL KIERSTEAD, BOJAN MOHAR, SIMON ŠPACAPAN, DAQING

More information

4.1 Interval Scheduling. Chapter 4. Greedy Algorithms. Interval Scheduling: Greedy Algorithms. Interval Scheduling. Interval scheduling.

4.1 Interval Scheduling. Chapter 4. Greedy Algorithms. Interval Scheduling: Greedy Algorithms. Interval Scheduling. Interval scheduling. Cptr 4 4 Intrvl Suln Gry Alortms Sls y Kvn Wyn Copyrt 005 Prson-Ason Wsly All rts rsrv Intrvl Suln Intrvl Suln: Gry Alortms Intrvl suln! Jo strts t s n nss t! Two os omptl ty on't ovrlp! Gol: n mxmum sust

More information

CS200: Graphs. Graphs. Directed Graphs. Graphs/Networks Around Us. What can this represent? Sometimes we want to represent directionality:

CS200: Graphs. Graphs. Directed Graphs. Graphs/Networks Around Us. What can this represent? Sometimes we want to represent directionality: CS2: Grphs Prihr Ch. 4 Rosn Ch. Grphs A olltion of nos n gs Wht n this rprsnt? n A omputr ntwork n Astrtion of mp n Soil ntwork CS2 - Hsh Tls 2 Dirt Grphs Grphs/Ntworks Aroun Us A olltion of nos n irt

More information

Graph Isomorphism. Graphs - II. Cayley s Formula. Planar Graphs. Outline. Is K 5 planar? The number of labeled trees on n nodes is n n-2

Graph Isomorphism. Graphs - II. Cayley s Formula. Planar Graphs. Outline. Is K 5 planar? The number of labeled trees on n nodes is n n-2 Grt Thortil Is In Computr Sin Vitor Amhik CS 15-251 Ltur 9 Grphs - II Crngi Mllon Univrsity Grph Isomorphism finition. Two simpl grphs G n H r isomorphi G H if thr is vrtx ijtion V H ->V G tht prsrvs jny

More information

CS61B Lecture #33. Administrivia: Autograder will run this evening. Today s Readings: Graph Structures: DSIJ, Chapter 12

CS61B Lecture #33. Administrivia: Autograder will run this evening. Today s Readings: Graph Structures: DSIJ, Chapter 12 Aministrivi: CS61B Ltur #33 Autogrr will run this vning. Toy s Rings: Grph Struturs: DSIJ, Chptr 12 Lst moifi: W Nov 8 00:39:28 2017 CS61B: Ltur #33 1 Why Grphs? For xprssing non-hirrhilly rlt itms Exmpls:

More information

24.1 Sex-Linked Inheritance. Chapter 24 Chromosomal Basis of Inheritance Sex-Linked Inheritance Sex-Linked Inheritance

24.1 Sex-Linked Inheritance. Chapter 24 Chromosomal Basis of Inheritance Sex-Linked Inheritance Sex-Linked Inheritance ptr 24 romosoml sis o Inritn 24. Sx-Link Inritn Normlly, ot mls n mls v 23 pirs o romosoms 22 pirs r ll utosoms On pir is t sx romosoms Mls r XY mls r XX opyrit T Mrw-Hill ompnis, In. Prmission rquir or

More information

COMPLEXITY OF COUNTING PLANAR TILINGS BY TWO BARS

COMPLEXITY OF COUNTING PLANAR TILINGS BY TWO BARS OMPLXITY O OUNTING PLNR TILINGS Y TWO RS KYL MYR strt. W show tht th prolm o trmining th numr o wys o tiling plnr igur with horizontl n vrtil r is #P-omplt. W uil o o th rsults o uquir, Nivt, Rmil, n Roson

More information

BASIC CAGE DETAILS SHOWN 3D MODEL: PSM ASY INNER WALL TABS ARE COINED OVER BASE AND COVER FOR RIGIDITY SPRING FINGERS CLOSED TOP

BASIC CAGE DETAILS SHOWN 3D MODEL: PSM ASY INNER WALL TABS ARE COINED OVER BASE AND COVER FOR RIGIDITY SPRING FINGERS CLOSED TOP MO: PSM SY SI TIS SOWN SPRIN INRS OS TOP INNR W TS R OIN OVR S N OVR OR RIIITY. R TURS US WIT OPTION T SINS. R (UNOMPRSS) RR S OPTION (S T ON ST ) IMNSIONS O INNR SIN TO UNTION WIT QU SM ORM-TOR (zqsp+)

More information

Edge-Triggered D Flip-flop. Formal Analysis. Fundamental-Mode Sequential Circuits. D latch: How do flip-flops work?

Edge-Triggered D Flip-flop. Formal Analysis. Fundamental-Mode Sequential Circuits. D latch: How do flip-flops work? E-Trir D Flip-Flop Funamntal-Mo Squntial Ciruits PR A How o lip-lops work? How to analys aviour o lip-lops? R How to sin unamntal-mo iruits? Funamntal mo rstrition - only on input an an at a tim; iruit

More information

Theorem 1. An undirected graph is a tree if and only if there is a unique simple path between any two of its vertices.

Theorem 1. An undirected graph is a tree if and only if there is a unique simple path between any two of its vertices. Cptr 11: Trs 11.1 - Introuton to Trs Dnton 1 (Tr). A tr s onnt unrt rp wt no sp ruts. Tor 1. An unrt rp s tr n ony tr s unqu sp pt twn ny two o ts vrts. Dnton 2. A root tr s tr n w on vrtx s n snt s t

More information

Physics 222 Midterm, Form: A

Physics 222 Midterm, Form: A Pysis 222 Mitrm, Form: A Nm: Dt: Hr r som usul onstnts. 1 4πɛ 0 = 9 10 9 Nm 2 /C 2 µ0 4π = 1 10 7 tsl s/c = 1.6 10 19 C Qustions 1 5: A ipol onsistin o two r point-lik prtils wit q = 1 µc, sprt y istn

More information

Why the Junction Tree Algorithm? The Junction Tree Algorithm. Clique Potential Representation. Overview. Chris Williams 1.

Why the Junction Tree Algorithm? The Junction Tree Algorithm. Clique Potential Representation. Overview. Chris Williams 1. Why th Juntion Tr lgorithm? Th Juntion Tr lgorithm hris Willims 1 Shool of Informtis, Univrsity of Einurgh Otor 2009 Th JT is gnrl-purpos lgorithm for omputing (onitionl) mrginls on grphs. It os this y

More information

DUET WITH DIAMONDS COLOR SHIFTING BRACELET By Leslie Rogalski

DUET WITH DIAMONDS COLOR SHIFTING BRACELET By Leslie Rogalski Dut with Dimons Brlt DUET WITH DIAMONDS COLOR SHIFTING BRACELET By Lsli Roglski Photo y Anrw Wirth Supruo DUETS TM from BSmith rt olor shifting fft tht mks your work tk on lif of its own s you mov! This

More information

Nefertiti. Echoes of. Regal components evoke visions of the past MULTIPLE STITCHES. designed by Helena Tang-Lim

Nefertiti. Echoes of. Regal components evoke visions of the past MULTIPLE STITCHES. designed by Helena Tang-Lim MULTIPLE STITCHES Nrtiti Ehos o Rgl omponnts vok visions o th pst sign y Hln Tng-Lim Us vrity o stiths to rt this rgl yt wrl sign. Prt sping llows squr s to mk roun omponnts tht rp utiully. FCT-SC-030617-07

More information

UNCORRECTED SAMPLE PAGES

UNCORRECTED SAMPLE PAGES Numrs n surs Aritmti is t stuy o numrs n oprtions on tm. Tis sort ptr rviws wol numrs, intrs, rtionl numrs n rl numrs, wit prtiulr ttntion to t ritmti o surs n tir pproximtions. Most o tis mtril will milir

More information

Revisiting Decomposition Analysis of Geometric Constraint Graphs

Revisiting Decomposition Analysis of Geometric Constraint Graphs Rvisitin Domposition Anlysis o Gomtri Constrint Grps R. Jon-Arinyo A. Soto-Rir S. Vil-Mrt J. Vilpln-Pstó Univrsitt Politèni Ctluny Dprtmnt Llnuts i Sistms Inormàtis Av. Dionl 647, 8, E 08028 Brlon [rort,

More information

BASIC CAGE DETAILS D C SHOWN CLOSED TOP SPRING FINGERS INNER WALL TABS ARE COINED OVER BASE AND COVER FOR RIGIDITY

BASIC CAGE DETAILS D C SHOWN CLOSED TOP SPRING FINGERS INNER WALL TABS ARE COINED OVER BASE AND COVER FOR RIGIDITY SI TIS SOWN OS TOP SPRIN INRS INNR W TS R OIN OVR S N OVR OR RIIITY. R IMNSIONS O INNR SIN TO UNTION WIT QU SM ORM-TOR (zqsp+) TRNSIVR. R. RR S OPTION (S T ON ST ) TURS US WIT OPTION T SINS. R (INSI TO

More information

Strongly connected components. Finding strongly-connected components

Strongly connected components. Finding strongly-connected components Stronly onnt omponnts Fnn stronly-onnt omponnts Tylr Moor stronly onnt omponnt s t mxml sust o rp wt rt pt twn ny two vrts SE 3353, SMU, Dlls, TX Ltur 9 Som sls rt y or pt rom Dr. Kvn Wyn. For mor normton

More information

CS150 Sp 98 R. Newton & K. Pister 1

CS150 Sp 98 R. Newton & K. Pister 1 Outin Cok Synronous Finit- Mins Lst tim: Introution to numr systms: sin/mnitu, ons ompmnt, twos ompmnt Rviw o ts, ip ops, ountrs Tis tur: Rviw Ts & Trnsition Dirms Impmnttion Usin D Fip-Fops Min Equivn

More information

Chapter 18. Minimum Spanning Trees Minimum Spanning Trees. a d. a d. a d. f c

Chapter 18. Minimum Spanning Trees Minimum Spanning Trees. a d. a d. a d. f c Chptr 8 Minimum Spnning Trs In this hptr w ovr importnt grph prolm, Minimum Spnning Trs (MST). Th MST o n unirt, wight grph is tr tht spns th grph whil minimizing th totl wight o th gs in th tr. W irst

More information

N=4 L=4. Our first non-linear data structure! A graph G consists of two sets G = {V, E} A set of V vertices, or nodes f

N=4 L=4. Our first non-linear data structure! A graph G consists of two sets G = {V, E} A set of V vertices, or nodes f lulu jwtt pnlton sin towr ounrs hpl lpp lu Our irst non-linr t strutur! rph G onsists o two sts G = {V, E} st o V vrtis, or nos st o E s, rltionships twn nos surph G onsists o sust o th vrtis n s o G jnt

More information

Experiment # 3 Introduction to Digital Logic Simulation and Xilinx Schematic Editor

Experiment # 3 Introduction to Digital Logic Simulation and Xilinx Schematic Editor EE2L - Introution to Diitl Ciruits Exprimnt # 3 Exprimnt # 3 Introution to Diitl Loi Simultion n Xilinx Smti Eitor. Synopsis: Tis l introus CAD tool (Computr Ai Dsin tool) ll Xilinx Smti Eitor, wi is us

More information

NP-Completeness. CS3230 (Algorithm) Traveling Salesperson Problem. What s the Big Deal? Given a Problem. What s the Big Deal? What s the Big Deal?

NP-Completeness. CS3230 (Algorithm) Traveling Salesperson Problem. What s the Big Deal? Given a Problem. What s the Big Deal? What s the Big Deal? NP-Compltnss 1. Polynomil tim lgorithm 2. Polynomil tim rution 3.P vs NP 4.NP-ompltnss (som slis y P.T. Um Univrsity o Txs t Dlls r us) Trvling Slsprson Prolm Fin minimum lngth tour tht visits h ity on

More information

Problem solving by search

Problem solving by search Prolm solving y srh Tomáš voo Dprtmnt o Cyrntis, Vision or Roots n Autonomous ystms Mrh 5, 208 / 3 Outlin rh prolm. tt sp grphs. rh trs. trtgis, whih tr rnhs to hoos? trtgy/algorithm proprtis? Progrmming

More information

S i m p l i f y i n g A l g e b r a SIMPLIFYING ALGEBRA.

S i m p l i f y i n g A l g e b r a SIMPLIFYING ALGEBRA. S i m p l i y i n g A l g r SIMPLIFYING ALGEBRA www.mthltis.o.nz Simpliying SIMPLIFYING Algr ALGEBRA Algr is mthmtis with mor thn just numrs. Numrs hv ix vlu, ut lgr introus vrils whos vlus n hng. Ths

More information

Designing A Concrete Arch Bridge

Designing A Concrete Arch Bridge This is th mous Shwnh ri in Switzrln, sin y Rort Millrt in 1933. It spns 37.4 mtrs (122 t) n ws sin usin th sm rphil mths tht will monstrt in this lsson. To pro with this lsson, lik on th Nxt utton hr

More information

Graph Contraction and Connectivity

Graph Contraction and Connectivity Chptr 17 Grph Contrtion n Conntivity So r w hv mostly ovr thniqus or solving prolms on grphs tht wr vlop in th ontxt o squntil lgorithms. Som o thm r sy to prllliz whil othrs r not. For xmpl, w sw tht

More information

Multipoint Alternate Marking method for passive and hybrid performance monitoring

Multipoint Alternate Marking method for passive and hybrid performance monitoring Multipoint Altrnt Mrkin mtho or pssiv n hyri prormn monitorin rt-iool-ippm-multipoint-lt-mrk-00 Pru, Jul 2017, IETF 99 Giuspp Fiool (Tlom Itli) Muro Coilio (Tlom Itli) Amo Spio (Politnio i Torino) Riro

More information