One-Dimensional Computational Topology

Size: px
Start display at page:

Download "One-Dimensional Computational Topology"

Transcription

1 Wr rltn so n Stz: Dnn un nur nn, wnn s Sm s Grpn I) ur nn Umsltunsoprton U n BZ-R lrt, II) ur Umrunsoprton wr us r BZ-R ntstt, stllt s Sm nn u r Kullä rlsrrn Grpn r. Dmt st n Gusss Prolm ür n llmnstn Grpn vrtr Ornun löst. [Tus w v t ollown torm: A rp sm rprsnts plnr rp n only I) pplyn t swtn oprton U to t sm prous tr-onon o, n II) pplyn t nvrson oprton to t tr-onon o rovrs t ornl sm. Tus, Guss s prolm s solv or 4-rulr rps.] Mx Dn, Ür Comntors Topolo (1936) Dntons n Rprsnttons Rll tt los urv n t pln s ontnuous unton γ: S 1 2. Prvously w onsr smpl los urvs, wr t unton γ s ntv; or ts ltur w rmov ts rstrton. pts, ontnton, rvrsl Artrry los urvs r nsty orrl tns tt wll t your o; you tout topolost s sn urvs n Pno n Hlrt urvs wr, ust tn o t snnns you n t up to wn t urv s llow to sl-ntrst! Fortuntly, tou, ts s omputtonl topoloy lss, w mns w only n to onsr urvs tt v som nt rprsntton tt n mnpult lortmlly. I ll ous on tr ommon rprsnttons: Polyons Polyons r t smplst (n olst) mol or plnr urvs. Rll tt polyon s pws-lnr los urv. Any polyon s nturlly rprsnt y nt squn o ponts p 0, p 1,..., p n 1 ll ts vrts; t polyon tsl s ompos o t ln smnts p p +1 mo n or nx, ll ts s. W n usully (ut not lwys!) ssum wtout loss o nrlty tt t polyon s n nrl poston, mnn tt ll vrts r stnt, no vrtx ls n t ntror o n, n t most two s ntrst t ny pont Wls n rps Clos urvs n lso rprsnt s los wls n som unrlyn pln rp G. T plnr mn o G my sp tr purly omntorlly (s rotton systm) or pws-lnrly (y spyn oornts or vrtx). Hr w usully nnot m ny nrl postons ssumptons; n prtulr, t sm wl my rvst t sm vrtx multpl tms, or trvrs t sm multpl tms n tr rton. T s o t unrlyn rp G my v wts; t lnt o wl s t sum o t wts o ts s, ount wt pproprt multplty. A vrnt o ts rprsntton onsrs ny urv to l rtrrly los to G rtr tn n G tsl. Rpl vrtx o o G wt smll s n o G wt ron twn t ss o ts nponts. Wtn ts ron rp, w n prtur ny urv γ nto nrl poston, so tt γ ntrsts only wtn t vrtx ss, n only trnsvrsly. Tus, Copyrt 2017 J Erson. Ts wor s lns unr Crtv Commons Lns (ttp://rtvommons.or/lnss/y-n-s/4.0/). Fr struton s stronly nour; ommrl struton s xprssly orn. S ttp://.s.llnos.u/tn/topoloy17/ or t most rnt rvson. 1

2 t ntrston o t urv wt ny ron onssts o sont prlll pts. W otn on t r ow t urv vs ns t vrtx ss, ut nssry, w n ssum wtout loss o nrlty tt ny two urv smnts ns vrtx s ntrst on trnsvrsly or not t ll. T tul rprsntton stors t wl n G, totr wt lt-to-rt orrn o t urv smnts wtn ron. Equvlntly, w n spy urv y ts ntrstons wt t s o t ul mp G ; Ér Coln Vrèr n I nm ts t ross-mtr mol. W ssum tt t rprsnt urv γ vos t vrts o G, tt o G ntrsts γ trnsvrsly t stnt ponts, n (typlly) tt ny two smnts o γ wtn t sm ntrst t most on. T ovrly o G n γ s vrtx or ntrston o γ wt s o G, n n or vry smnt o γ or G twn t ovrly vrts. Tn γ tsl s rprsnt s smpl wl n ts ovrly rp. T lnt o urv γ n t ross-mtr mol s t sum o t wts o t s o G tt γ rosss, ount wt pproprt multplty. Any polyon n onvrt nto wl n ts m rp; onvrsly, t unrlyn rp G s m pws-lnrly (or n t ross-mtr mol, vry smnt wtn s ln smnt), tn vry wl n G s polyon Gnr urvs Fnlly, w n rprsnt suntly n urvs rtly y norn tr omtry ntrly. A sl-ntrston γ(s) = γ(t) o urv γ s trnsvrs, or som ɛ > 0, t supts γ(s ɛ, s+ɛ) n γ(t ɛ, t + ɛ) r omomorp to two ortoonl lns. A los urv s nr vry sl-ntrston s trnsvrs; omptnss mpls tt nr mmrson s nt numr o sl-ntrston ponts. Gnr urvs r somtms ll mmrsons or rulr urvs, ut tt trm mor ommonly rrs to los urvs wt ontnuous non-zro rvtvs [11]. In t, t most ommon wor us to sr ts lss o urvs s urv! T trm nr s ust y t osrvton tt vry los urv s rtrrly los to nr los urv. Mor ormlly: Lmm 2.1. For ny los urv γ: S 1 2 n ny ɛ > 0, tr s nr los urv γ : S 1 2 su tt γ(t) γ (t) < ɛ or ll t S 1. Proo: Fx los urv γ: S 1 2 n rl numr ɛ > 0. By oosn n rtrry spont on t rl, w n rr γ s pro unton γ: 2 wr γ(t) = γ(t + 1) or ll t. Comptnss mpls tt w n ovr γ wt nt numr o lls 0, 1, 2,..., n o rus ɛ/4, wr ll s ntr t som pont γ(t), n n prtulr, 0 s ntr t γ(0) = γ(1). For ny nx, lt B not t ll o rus ɛ/2 wt t sm ntr s. W nutvly n nt squn o rl numrs t 0 < t 1 < < t N n ns 0, 1, 2,..., N s ollows. Frst, lt t 0 = 0 n 0 = 0. Tn or ny nx > 0, n t = mn 1, mn{t > t 1 γ(t) B 1 } I t = 1, w st = 0; otrws, lt ny nx su tt γ(t ). Comptnss mpls tt γ s unormly ontnunuous: Tr s rl numr δ > 0 su tt or ny t n t, γ(t) γ(t ) < ɛ/4, tn t t < δ. It ollows tt t N = 1 or som ntr N 1/δ. T ponts γ(t 0 ), γ(t 1 ),..., γ(t N ) n n n-vrtx polyon γ, w w n prmtrz so tt γ(t ) = γ(t ) or vry nx. By onstruton, w v γ(t) γ(t) < ɛ/2 or ll t S 1. Ts polyon s not nssrly nr; n prtulr, t my ontn rpt vrts. Howvr, wt prolty 1 w n otn nr polyon γ y movn vrtx o γ 2

3 stn o ɛ/4 n rnom rton (osn unormly rom S 1 ). Convxty o t Euln norm mpls tt γ (t) γ (t) < ɛ/2 or ll t S 1. Tus, t trnl nqulty mpls γ(t) γ (t) < γ(t) γ(t) + γ(t) γ (t) < ɛ or ll t S 1. Any non-smpl nr urv γ n nturlly rprsnt y ts m rp, w s onnt 4-rulr pln rp, wos vrts r t ponts o prws sl-ntrston.1 Any nr urv γ s rtn nonl Eulr tour o ts m rp; wnvr t tour ntrs vrtx trou rt, t xts tt vrtx trou t oppost rt rv(su(su())). Tus, t rp n rprsnt y t m rp tsl, wt no tonl normton. As usul, t m rp n rprsnt tr omntorlly or omtrlly. Altrntvly, ny non-smpl nr urv n rprsnt y Guss o, n y Guss s ollows. Assn sl-ntrston pont o γ unqu ll; t uss o o γ s t squn o lls nountr y pont movn on roun γ, strtn t n rtrry spont. A sn Guss o lso rors ow t urv rosss tsl t vrtx: postv or rt-to-lt rossns n ntv or lt-to-rt rossns. Fur 2.1. A urv wt sn Guss o Guss Co Plnrty Aroun 1830, Guss [5] s ow to trmn wtr vn Guss o rprsnts plnr urv, or mor suntly, wtr vn Guss o s plnr. Frns sr t rst lortm soluton or sn Guss os, w onsst o ust twlv nstrutons [4]; Crtr ltr sr mu mor nturl n nrl ( somwt lss nt) soluton [1].2 Crtr osrv tt vry sn Guss o orrspons to unqu 4-rulr rp wt unqu rotton systm. Evry 4-rulr rp n t pln wt n vrts s xtly n + 2 s, y Eulr s ormul. Tus, sn Guss o s plnr n only t nu rp mn s xtly n + 2 s.3 Guss tully s mu mor ult quston: W unsn os orrspon to plnr urvs? Ts s ruly t vry rst nontrvl omputtonl topoloy prolm!evry unsn Guss o lso rprsnts unqu 4-rulr rp wt wll-n yl orr o s roun vrtx, ut lvs unsp w rottons r lows or ountrlows. Guss s quston s to trmn wtr t yl orrs n ornt so tt t rsultn mp s plnr. 1T m o smpl nr urv s ovously smpl yl. 2It s possl tt Frns s lortm s tully quvlnt to Crtr s, ut I vn t su n sssmln Frns s unommnt mn o. 3Mor nrlly, ny Guss o nus n mn o 4-rulr rp onto som orntl sur, w ltr utors ll t Crtr sur o t Guss o. 3

4 2.2.1 Guss s Prty Conton Guss osrv wtout proo tt t Guss o o vry plnr urv stss smpl prty onton: Evry sustrn tt strts n ns wt t sm symol s vn lnt, or quvlntly, symol pprs on t n vn nx n on t n o nx. Ts prty onton ws rst prov nssry y Ny [8], ultmtly y ruton to t Jorn urv torm; n lmntry proo ws ltr vn y Rmr n Topltz [9]. Guss lso osrv tt t squns n stsy s prty onton ut nnot rlz y plnr urvs, so t prty onton s not sunt. In t, Ny [8] tully sr omplt lortm to ronstrut plnr urv rom ts Guss o, n tus to trmn wtr Guss o s plnr. Ny s lortm s vry rnt rom t ppro sr low, n t s unlr wtr t n mplmnt to run s quly, so I wll r tl srpton o Ny s ppro to t omwor Dn s Tr-Onon Conton Aout 100 yrs tr Guss, Dn [2] sr s Gusss Prolm r Trt n propos notr lortm to tt plnr Guss os. Dn rst unrosss t vn Guss o y rvrsn vry sustrn twn ntl lttrs, n rtrry orr. I t vn Guss o s plnr, rvrsl orrspons to smootn vrtx o t urv, rvrsn on o t two suurvs tt strt n n t tt vrtx, so tt t ovrll smoot urv rmns onnt. For xmpl, vn t Guss o, Dn mt pro s ollows, rvrsn t sustrns n lptl orr: T rsultn strn nos wly smpl los urv tt tous tsl tnntlly t o t ornl vrts. Bus w n rvrs sustrns n ny orr, t rsultn tou o (n t orrsponn urv) s not unqu. I w rvrs t sustrns on t tm y rut or, t ntr untnln pross rqurs O(n 2 ) tm, ut s w ll s sortly, t s possl to untnl ny Guss o n O(n) tm. T Guss rm o t tou o onssts o yl o 2n vrts, ll y t symols n t tou o n orr, plus s onn pr o ntl symols. Dn prov tt Guss o s plnr, tn t Guss rm o t rsultn tou o s plnr rp; tt s, w n m som o t ors ns t rl n t rst o t ors outs t rl so tt no pr o ors ntrsts. Dn rrr to plnr Guss rms s Bum-Zwl Furn [ tr-onon rms ] n tr orrsponn os s Bum-Zwl Rn [ tr-onon strns ], us ty n lso us to sr tr-otr ompostons o rtrry pln rps. 4

5 Fur 2.2. Lt: Smootn vrtx o plnr urv, rom Dn [2]. Rt: A smoot urv wt Guss tou o. Fur 2.3. Lt: A tr-onon ur, rom Dn [2]. Rt: T plnr Guss rm o. Dn s onton n xprss mor ntly n trms o rnt rp, ll t ntrlv rp o t o. T ntrlv s n vrts, on or stnt symol n t tou o, n ny twn ny two symols tt ntrlv x... y... x... y n t o. A Guss rm s plnr n only ts ntrlv rp s prtt. T ntrlv rp s O(n 2 ) vrts n s, n w n sly prttnss n O(n 2 ) tm. Fur 2.4. T prtt ntrlv rp o. To omplt s lortm, Dn osrv tt w n trnsorm ny Guss rm nto 4-rulr rp y rpln or wt pr o rossn ors wt rossn, s sown n Fur 2.5. Ts rrossn pross yls snl los urv onsstnt wt our ornl Guss o tn, trvlly, t ornl Guss o s plnr. Otrws, t ornl Guss o s not plnr. Dn osrv tt s tr-onon onton s nssry ut not sunt or plnrty onsr t Guss o n s wtr Guss s prty onton n Dn s tr-onon onton r sunt. In t, ts two ontons r sunt, s prov y Dowr n Tstltwt [3] lmost 50 yrs ltr. 5

6 Fur 2.5. Lt: Buln los urv rom tr-onon rm, rom Dn [2]. Rt: A plnr urv onsstnt wt t ornl Guss o, tr Dn [2] n Kumnn [7] Morn Proo Rtr tn rptn Dowr n Tstltwt s rumnt, I ll v smpl sl-ontn rtrzton o plnr Guss os wt omplt proo. Ts rtrzton s ultmtly s on t ontons o Guss n Dn, ut uss mor morn lortm tools sr y Rosnstl n Trn [10]. (Rosnstl n Trn [10] sr n nt mplmntton o Dn s lortm, nlun t son untnln ps, wtout xplotn Guss s prty onton.) W strt wt smpl onsqun o t Jorn urv torm. Lmm 2.2. Evry pr o nr los urvs tt ntrst only trnsvrsly ntrst t n vn numr o ponts. Proo: Lt α n β nr pr o los urvs. Rll t prty tst or n wtr pont s n t ntror o smpl los urv or not. T sm prty tst llows us to olor t s o β ltrntly l n wt, so tt ny two s tt sr n v oppost olors. Now mn pont movn roun α; tm ts pont rosss β, t movs rom wt to l or v vrs. T movn pont strts n ns n t sm, n tror must n olor n vn numr o tms. Now lt X strn o lnt 2n, n w o t n unqu symols pprs tw. Lmm 2.3. I X s t Guss o o plnr urv, tn vry sustrn o X tt strts n ns wt t sm symol s vn lnt. Proo: Lt γ plnr los urv. Smootn γ t ny vrtx prous two suurvs α n β. Up to yl st (rltn n o spont), t Guss o or γ n wrttn s x y, wr strn x nos t vrts lon α n strn y nos t vrts lon β. E sl-ntrston pont o α s no n x tw, n t otr symols o x no t ntrstons twn α n β. W onlu tt x s vn lnt, w omplts t proo. T strn X ns 4-rulr rp G(X ) wos vrts r t n stnt symols n X, n wos s orrspon to (yl) sustrns o lnt 2. Morovr, X ns prtulr Eulr tour o G(X ); t s o ts tour r ltrntly rt orwr n wr. S 6

7 rntly, G(X ) s rt rp wt s x x +1 n x x 1 mo 2n or vry vn nx. For xmpl, X =, t rp G(X ) onssts o t ollown s: S Fur 2.6. Fur 2.6. A urv wt ltrntly ornt smnts. Torm 2.4. X s plnr Guss o n only G(X ) s plnr mn tt ontns wly smpl Eulr tour. Proo: Frst, suppos X s t Guss o o plnr urv γ. Expt or t ornttons, G(X ) s t m rp o γ. Lmm 2.3 mpls tt vry vrtx o G(X ) s n-r 2 n out-r 2, so G(X ) s n Eulr tour. Morovr, t s nnt to vrtx o G(X ) ltrnt n, out, n, out. It ollows tt vry Eulr tour o G(X ) s wly smpl. Convrsly, suppos G(X ) s plnr mn tt ontns wly smpl Eulr tour T. Wnn numr rumnts mply tt t s nnt to vrtx o G(X ) ltrnt n, out, n, out. T ornl strn X ns n unrt Eulr tour U o G(X ), w trvrss s ltrntly orwr n wr. U rosss tsl t vry vrtx o G(X ). It ollows mmtly tt U s los urv wt Guss o X. 2.3 T Pl o Twn Sts Torm 2.4 vs omplt rtrzton o plnr Guss os, ut t lvs opn t quston o ow to plnrty lortmlly. Most o t lortm s strtorwr; w n ul t rt rp G(X ) n omput n Eulr tour T n O(n) tm, n on w v plnr mn o G(X ) tt ms T wly smpl, w n xtrt t urv U n O(n) tm. T r prt s n wtr T s plnr tou urv, or quvlntly, wtr t ntrl rp o T s prtt. W v lry sn ow to nswr ts quston n O(n 2 ) tm. In t rmnr o ts no, I ll sr n lortm o Rosnstl n Trn [10] tt solvs ts plnrty prolm n O(n) tm.⁴ Frst w opt vrnt notton propos npnntly y Dowr n Tstltwt [3]. W no t Guss o n n rry t[0.. 2n 1] tt nos or nx t nx o t otr ourrn o symol T[]. Tus, or nx, w v T[t[]] = T[] ut t[]. For xmpl, t Guss o ns t rry [12, 6, 21, 20, 18, 8, 1, 11, 5, 17, 13, 7, 0, 10, 16, 19, 14, 9, 4, 15, 3, 2] ⁴Ts s not t rst lortm to solv ts plnrty prolm n lnr tm. Aout tn yrs rlr, Hoprot n Trn [6] sr t rst lnr-tm lortm to n rtrry rp s plnr. At vry lvl, Hoprot n Trn s lortm rsmls Ny s 1927 lortm or n urv plnrty. 7

8 For t s o llustrton, w ornt ts nx rry vrtlly, n w pross t ns n t rry rom t top own. E stnt symol n t o rprsnts or n t Guss rm. W wnt to lssy ts ors nto two lsss lt n rt w n rsptvly m ns n outs t mn rl o t Guss rm wtout ntrstn. I w nw t lt-rt lsston n vn, w oul vry tt no two ors ntrst n O(n) tm usn two sts, s ollows. Hr w ssum t or symols r t ntrs 1 trou n, n t ooln rry IsLt nts w symols orrspon to lt ors. VryLR(T[0.. 2n 1], t[0.. 2n 1], IsLt[1.. n]): L nw st R nw st or 0 to 2n 1 t[] > rst npont IsLt[T[]] Pus(L, T[]) ls Pus(R, T[]) ls son npont IsLt[T[]] x Pop(L) ls x Pop(R) x T[] rturn Fls rturn Tru O ours w on t now t lt-rt lsston n vn; tt s wt w n to omput! Rosnstl n Trn s lortm uls ts lsston usn st o prs o sts; to lp vo onuson, t outr st s ll pl. E pr o sts on t pl onssts o lt st L n rt st R. At t n o t t trton o t nnr loop, t pl o sts ontns ll vlus t[] su tt < n t[]. In prtulr, t t strt n n o t lortm, t pl s mpty. E trton o t lortm mntns t ollown t strutur nvrnts: For lvl, tr L or R s non-mpty. For lvl, ll ors n L R l n t sm omponnt o t ntrlv rp. For ll lvl, no or n L R s ntrlv wt ny or n L R. For lvl, t sts L or R r sort n nrsn orr (tt s, ns r pus n rsn orr). T pl tsl s lso sort n nrsn orr: For lvl, ll ns n L R r smllr tn ll ns n L +1 R +1. Intutvly, t sts L n R n pr ontn ors o t Guss rm, rprsnt y tr r-numr nponts, tt must l on oppost ss o t mn rl. Equvlntly, t ntrlv rp ontns s twn vry nx n L n vry nx n R. Morovr, t ors n st r proprly nst. Howvr, t ors t lvl n npnntly m on tr s, tr wt L on t lt n R on t rt, or L on t rt n R 8

9 on t lt. Tus, t pl ontns lvls, tr r (t lst) 2 onsstnt mns o t ors n t pl. Stll n to tully sr t lortm. T[] t[] Pl o twn sts Oprtons Intrlvs oun 0 12 [12 ] nw pr, pus lt 1 6 [6 ], [12 ] nw pr, pus lt 2 21 [6, 12 21] ml, pus rt, 3 20 [6, 12 20, 21] pus rt 4 18 [6, 12 18, 20, 21] pus rt 5 8 [6, 12 8, 18, 20, 21] pus rt 6 1 [12 8, 18, 20, 21] pop lt 7 11 [11, 12 8, 18, 20, 21] pus lt 8 5 [11, 12 18, 20, 21] pop rt 9 17 [11, 12 17, 18, 20, 21] pus rt [11, 12 13, 17, 18, 20, 21] pus rt 11 7 [12 13, 17, 18, 20, 21] pop lt 12 0 [ 13, 17, 18, 20, 21] pop lt [ 17, 18, 20, 21] pop rt [16 ], [ 17, 18, 20, 21] nw pr, pus lt [19 16, 17, 18, 20, 21] swp top pr, ml, pus rt, [19 17, 18, 20, 21] pop rt 17 9 [19 18, 20, 21] pop rt 18 4 [19 20, 21] pop rt [ 20, 21] pop lt 20 3 [ 21] pop rt 21 2 pop rt, pop mpty pr Fur 2.7. Rosnstl n Trn s pl o twn sts lortm runnn on t strn 9

10 Rrns [1] J. Sott Crtr. Clssyn mmrs urvs. Pro. Amr. Mt. So. 111(1): , [2] Mx Dn. Ür omntors Topolo. At Mt. 67: , [3] Clor H. Dowr n Morwn B. Tstltwt. Clsston o not protons. Topoloy Appl. 16(1):19 31, [4] Gor K. Frns. Null nus rlzlty rtron or strt ntrston squns. J. Com. Tory 7(4): , [5] Crl Frr Guß. Nlss. I. Zur Gomtr stus. Wr, vol. 8, , Tunr. Ornlly wrttn twn 1823 n [6] Jon Hoprot n Rort E. Trn. Ent plnrty tstn. J. Asso. Comput. M. 21(4): , [7] Lous H. Kumn. Vrtul not tory. Europ. J. Comn. 20(7): , rxv:mt/ [8] Julus v. Sz. Ny. Ür n topoloss Prolm von Guß. Mt. Z. 26(1): , [9] Hns Rmr n Otto Topltz. On los sl-ntrstn urvs. T Enoymnt o Mtmts: Sltons rom Mtmts or t Amtur, ptr 10, 61 66, Dovr Pul. Ornlly puls y Prnton Unv. Prss, [10] Prr Rosnstl n Rort E. Trn. Guss os, plnr Hmltonn rps, n st-sortl prmuttons. J. Alortms 5(3): , [11] Hsslr Wtny. On rulr los urvs n t pln. Composto Mt. 4: , Copyrt 2017 J Erson. Ts wor s lns unr Crtv Commons Lns (ttp://rtvommons.or/lnss/y-n-s/4.0/). Fr struton s stronly nour; ommrl struton s xprssly orn. S ttp://.s.llnos.u/tn/topoloy17/ or t most rnt rvson. 10

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

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

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

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

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

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

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

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

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

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

Minimum Spanning Trees (CLRS 23)

Minimum Spanning Trees (CLRS 23) Mnmum Spnnn Trs (CLRS 3) T prolm Rll t nton o spnnn tr: Gvn onnt, unrt rp G = (V, E), sust o s o G su tt ty onnt ll vrts n G n orm no yls s ll spnnn tr (ST) o G. Any unrt, onnt rp s spnnn tr. Atully, rp

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

(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

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

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

Graph Search (6A) Young Won Lim 5/18/18

Graph Search (6A) Young Won Lim 5/18/18 Grp Sr (6A) Youn Won Lm Copyrt () 2015 2018 Youn W. Lm. Prmon rnt to opy, trut n/or moy t oumnt unr t trm o t GNU Fr Doumntton Ln, Vron 1.2 or ny ltr vron pul y t Fr Sotwr Founton; wt no Invrnt Ston, no

More information

Minimum Spanning Trees (CLRS 23)

Minimum Spanning Trees (CLRS 23) Mnmum Spnnn Trs (CLRS 3) T prolm Gvn onnt, unrt rp G = (V, E), sust o s o G su tt ty onnt ll vrts n G n orm no yls s ll spnnn tr (ST) o G. Clm: Any unrt, onnt rp s spnnn tr (n nrl rp my v mny spnnn trs).

More information

Lecture II: Minimium Spanning Tree Algorithms

Lecture II: Minimium Spanning Tree Algorithms Ltur II: Mnmum Spnnn Tr Alortms Dr Krn T. Hrly Dprtmnt o Computr Sn Unvrsty Coll Cork Aprl 0 KH (/0/) Ltur II: Mnmum Spnnn Tr Alortms Aprl 0 / 5 Mnmum Spnnn Trs Mnmum Spnnn Trs Spnnn Tr tr orm rom rp s

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

2 Trees and Their Applications

2 Trees and Their Applications Trs n Tr Appltons. Proprts o trs.. Crtrzton o trs Dnton. A rp s ll yl (or orst) t ontns no yls. A onnt yl rp s ll tr. Quston. Cn n yl rp v loops or prlll s? Notton. I G = (V, E) s rp n E, tn G wll not

More information

COMP 250. Lecture 29. graph traversal. Nov. 15/16, 2017

COMP 250. Lecture 29. graph traversal. Nov. 15/16, 2017 COMP 250 Ltur 29 rp trvrsl Nov. 15/16, 2017 1 Toy Rursv rp trvrsl pt rst Non-rursv rp trvrsl pt rst rt rst 2 Hs up! Tr wr w mstks n t sls or S. 001 or toy s ltur. So you r ollown t ltur rorns n usn ts

More information

17 Basic Graph Properties

17 Basic Graph Properties Ltur 17: Bs Grp Proprts [Sp 10] O look t t sn y o. Tn t t twnty-svn 8 y 10 olor lossy pturs wt t rls n rrows n prrp on t k o on... n tn look t t sn y o. An tn t t twnty-svn 8 y 10 olor lossy pturs wt t

More information

Closed Monochromatic Bishops Tours

Closed Monochromatic Bishops Tours Cos Monoromt Bsops Tours Jo DMo Dprtmnt o Mtmts n Sttsts Knnsw Stt Unvrsty, Knnsw, Gor, 0, USA mo@nnsw.u My, 00 Astrt In ss, t sop s unqu s t s o to sn oor on t n wt or. Ts ms os tour n w t sop vsts vry

More information

The R-Tree. Yufei Tao. ITEE University of Queensland. INFS4205/7205, Uni of Queensland

The R-Tree. Yufei Tao. ITEE University of Queensland. INFS4205/7205, Uni of Queensland Yu To ITEE Unvrsty o Qunsln W wll stuy nw strutur ll t R-tr, w n tout o s mult-mnsonl xtnson o t B-tr. T R-tr supports ntly vrty o qurs (s w wll n out ltr n t ours), n s mplmnt n numrous ts systms. Our

More information

Having a glimpse of some of the possibilities for solutions of linear systems, we move to methods of finding these solutions. The basic idea we shall

Having a glimpse of some of the possibilities for solutions of linear systems, we move to methods of finding these solutions. The basic idea we shall Hvn lps o so o t posslts or solutons o lnr systs, w ov to tos o nn ts solutons. T s w sll us s to try to sply t syst y lntn so o t vrls n so ts qutons. Tus, w rr to t to s lnton. T prry oprton nvolv s

More information

Applications of trees

Applications of trees Trs Apptons o trs Orgnzton rts Attk trs to syst Anyss o tr ntworks Prsng xprssons Trs (rtrv o norton) Don-n strutur Mutstng Dstnton-s orwrng Trnsprnt swts Forwrng ts o prxs t routrs Struturs or nt pntton

More information

CSE 332. Data Structures and Parallelism

CSE 332. Data Structures and Parallelism Am Blnk Ltur 20 Wntr 2017 CSE 332 Dt Struturs n Prlllsm CSE 332: Dt Struturs n Prlllsm Grps 1: Wt s Grp? DFS n BFS LnkLsts r to Trs s Trs r to... 1 Wr W v Bn Essntl ADTs: Lsts, Stks, Quus, Prorty Quus,

More information

CSE 332. Graphs 1: What is a Graph? DFS and BFS. Data Abstractions. CSE 332: Data Abstractions. A Graph is a Thingy... 2

CSE 332. Graphs 1: What is a Graph? DFS and BFS. Data Abstractions. CSE 332: Data Abstractions. A Graph is a Thingy... 2 Am Blnk Ltur 19 Summr 2015 CSE 332: Dt Astrtons CSE 332 Grps 1: Wt s Grp? DFS n BFS Dt Astrtons LnkLsts r to Trs s Trs r to... 1 A Grp s Tny... 2 Wr W v Bn Essntl ADTs: Lsts, Stks, Quus, Prorty Quus, Hps,

More information

18 Basic Graph Properties

18 Basic Graph Properties O look t t sn y o. Tn t t twnty-svn 8 y 10 olor lossy pturs wt t rls n rrows n prrp on t k o on... n tn look t t sn y o. An tn t t twnty-svn 8 y 10 olor lossy pturs wt t rls n rrows n prrp on t k o on

More information

Graphs Depth First Search

Graphs Depth First Search Grp Dpt Frt Sr SFO 337 LAX 1843 1743 1233 802 DFW ORD - 1 - Grp Sr Aort - 2 - Outo Ø By unrtnn t tur, you ou to: q L rp orn to t orr n w vrt r ovr, xpor ro n n n pt-rt r. q Cy o t pt-rt r tr,, orwr n ro

More information

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

(4, 2)-choosability of planar graphs with forbidden structures (4, )-ooslty o plnr rps wt orn struturs Znr Brkkyzy 1 Crstopr Cox Ml Dryko 1 Krstn Honson 1 Mot Kumt 1 Brnr Lký 1, Ky Mssrsmt 1 Kvn Moss 1 Ktln Nowk 1 Kvn F. Plmowsk 1 Drrk Stol 1,4 Dmr 11, 015 Astrt All

More information

The Constrained Longest Common Subsequence Problem. Rotem.R and Rotem.H

The Constrained Longest Common Subsequence Problem. Rotem.R and Rotem.H T Constrn Lonst Common Susqun Prolm Rotm.R n Rotm.H Prsntton Outln. LCS Alortm Rmnr Uss o LCS Alortm T CLCS Prolm Introuton Motvton For CLCS Alortm T CLCS Prolm Nïv Alortm T CLCS Alortm A Dynm Prormmn

More information

SAMPLE CSc 340 EXAM QUESTIONS WITH SOLUTIONS: part 2

SAMPLE CSc 340 EXAM QUESTIONS WITH SOLUTIONS: part 2 AMPLE C EXAM UETION WITH OLUTION: prt. It n sown tt l / wr.7888l. I Φ nots orul or pprotng t vlu o tn t n sown tt t trunton rror o ts pproton s o t or or so onstnts ; tt s Not tt / L Φ L.. Φ.. /. /.. Φ..787.

More information

DOCUMENT STATUS: RELEASE

DOCUMENT STATUS: RELEASE RVSON STORY RV T SRPTON O Y 0-4-0 RLS OR PROUTON 5 MM -04-0 NS TRU PLOT PROUTON -- S O O OR TLS 30 MM 03-3-0 3-044 N 3-45, TS S T TON O PROTTV RM OVR. 3 05--0 LT 3-004, NOT, 3-050 3 0//00 UPT ST ROM SN,

More information

23 Minimum Spanning Trees

23 Minimum Spanning Trees 3 Mnmum Spnnn Trs Eltron rut sns otn n to mk t pns o svrl omponnts ltrlly quvlnt y wrn tm totr. To ntronnt st o n pns, w n us n rrnmnt o n wrs, onntn two pns. O ll su rrnmnts, t on tt uss t lst mount o

More information

Platform Controls. 1-1 Joystick Controllers. Boom Up/Down Controller Adjustments

Platform Controls. 1-1 Joystick Controllers. Boom Up/Down Controller Adjustments Ston 7 - Rpr Prours Srv Mnul - Son Eton Pltorm Controls 1-1 Joystk Controllrs Mntnn oystk ontrollrs t t propr sttns s ssntl to s mn oprton. Evry oystk ontrollr soul oprt smootly n prov proportonl sp ontrol

More information

Single Source Shortest Paths (with Positive Weights)

Single Source Shortest Paths (with Positive Weights) Snl Sour Sortst Pts (wt Postv Wts) Yuf To ITEE Unvrsty of Qunslnd In ts ltur, w wll rvst t snl sour sortst pt (SSSP) problm. Rll tt w v lrdy lrnd tt t BFS lortm solvs t problm ffntly wn ll t ds v t sm

More information

A Simple Method for Identifying Compelled Edges in DAGs

A Simple Method for Identifying Compelled Edges in DAGs A Smpl Mto or Intyn Compll Es n DAGs S.K.M. Won n D. Wu Dprtmnt o Computr Sn Unvrsty o Rn Rn Ssktwn Cn S4S 0A2 Eml: {won, nwu}@s.urn. Astrt Intyn ompll s s mportnt n lrnn t strutur (.., t DAG) o Bysn ntwork.

More information

MATERIAL SEE BOM ANGLES = 2 FINISH N/A

MATERIAL SEE BOM ANGLES = 2 FINISH N/A 9 NOTS:. SSML N NSPT PR SOP 0-9... NSTLL K STKR N X L STKR TO NS O SROU WT TP. 3. PR-PK LNR RNS WT P (XTRM PRSSUR NL R ) RS OR NNRN PPROV QUVLNT. 4. OLOR TT Y T SLS ORR. RRN T MNS OM OR OMPONNTS ONTNN

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

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

Dental PBRN Study: Reasons for replacement or repair of dental restorations

Dental PBRN Study: Reasons for replacement or repair of dental restorations Dntl PBRN Stuy: Rsons or rplmnt or rpr o ntl rstortons Us ts Dt Collton Form wnvr stuy rstorton s rpl or rpr. For nrollmnt n t ollton you my rpl or rpr up to 4 rstortons, on t sm ptnt, urn snl vst. You

More information

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

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

On Hamiltonian Tetrahedralizations Of Convex Polyhedra

On Hamiltonian Tetrahedralizations Of Convex Polyhedra O Ht Ttrrzts O Cvx Pyr Frs C 1 Q-Hu D 2 C A W 3 1 Dprtt Cputr S T Uvrsty H K, H K, C. E: @s.u. 2 R & TV Trsss Ctr, Hu, C. E: q@163.t 3 Dprtt Cputr S, Mr Uvrsty Nwu St. J s, Nwu, C A1B 35. E: w@r.s.u. Astrt

More information

Graph Search Algorithms

Graph Search Algorithms Grp Sr Aortms 1 Grp 2 No ~ ty or omputr E ~ ro or t Unrt or Drt A surprsny r numr o omputton proms n xprss s rp proms. 3 Drt n Unrt Grps () A rt rp G = (V, E), wr V = {1,2,3,4,5,6} n E = {(1,2), (2,2),

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

An Introduction to Clique Minimal Separator Decomposition

An Introduction to Clique Minimal Separator Decomposition Alortms 2010, 3, 197-215; o:10.3390/3020197 Rvw OPEN ACCESS lortms ISSN 1999-4893 www.mp.om/ournl/lortms An Introuton to Clqu Mnml Sprtor Domposton Ann Brry 1,, Romn Poorln 1 n Gnvèv Smont 2 1 LIMOS UMR

More information

Exam 2 Solutions. Jonathan Turner 4/2/2012. CS 542 Advanced Data Structures and Algorithms

Exam 2 Solutions. Jonathan Turner 4/2/2012. CS 542 Advanced Data Structures and Algorithms CS 542 Avn Dt Stutu n Alotm Exm 2 Soluton Jontn Tun 4/2/202. (5 ont) Con n oton on t tton t tutu n w t n t 2 no. Wt t mllt num o no tt t tton t tutu oul ontn. Exln you nw. Sn n mut n you o u t n t, t n

More information

CSE 332. Graphs 1: What is a Graph? DFS and BFS. Data Abstractions. CSE 332: Data Abstractions. A Graph is a Thingy... 2

CSE 332. Graphs 1: What is a Graph? DFS and BFS. Data Abstractions. CSE 332: Data Abstractions. A Graph is a Thingy... 2 Am Blnk Ltur 0 Autumn 0 CSE 33: Dt Astrtons CSE 33 Grps : Wt s Grp? DFS n BFS Dt Astrtons LnkLsts r to Trs s Trs r to... A Grp s Tny... Wr W v Bn Essntl ADTs: Lsts, Stks, Quus, Prorty Quus, Hps, Vnll Trs,

More information

Planar convex hulls (I)

Planar convex hulls (I) Covx Hu Covxty Gv st P o ots 2D, tr ovx u s t sst ovx oyo tt ots ots o P A oyo P s ovx or y, P, t st s try P. Pr ovx us (I) Coutto Gotry [s 3250] Lur To Bowo Co ovx o-ovx 1 2 3 Covx Hu Covx Hu Covx Hu

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

Data-Parallel Primitives for Spatial Operations Using PM. Quadtrees* primitives that are used to construct the data. concluding remarks.

Data-Parallel Primitives for Spatial Operations Using PM. Quadtrees* primitives that are used to construct the data. concluding remarks. Dt-rlll rmtvs or Sptl Oprtons Usn M Qutrs* Erk G. Hol Hnn Smt Computr Sn Dprtmnt Computr Sn Dprtmnt Cntr or Automton Rsr Cntr or Automton Rsr Insttut or Avn Computr Sns Insttut or Avn Computr Sns Unvrsty

More information

23 Minimum Spanning Trees

23 Minimum Spanning Trees 3 Mnmum Spnnn Trs Eltron rut sns otn n to mk t pns o svrl omponnts ltrlly quvlnt y wrn tm totr. To ntronnt st o n pns, w n us n rrnmnt o n wrs, onntn two pns. O ll su rrnmnts, t on tt uss t lst mount o

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

Phylogenetic Tree Inferences Using Quartet Splits. Kevin Michael Hathcock. Bachelor of Science Lenoir-Rhyne University 2010

Phylogenetic Tree Inferences Using Quartet Splits. Kevin Michael Hathcock. Bachelor of Science Lenoir-Rhyne University 2010 Pylont Tr Inrns Usn Qurtt Splts By Kvn Ml Htok Blor o Sn Lnor-Ryn Unvrsty 2010 Sumtt n Prtl Fulllmnt o t Rqurmnts or t Dr o Mstr o Sn n Mtmts Coll o Arts n Sns Unvrsty o Sout Croln 2012 Apt y: Év Czrk,

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

L.3922 M.C. L.3922 M.C. L.2996 M.C. L.3909 M.C. L.5632 M.C. L M.C. L.5632 M.C. L M.C. DRIVE STAR NORTH STAR NORTH NORTH DRIVE

L.3922 M.C. L.3922 M.C. L.2996 M.C. L.3909 M.C. L.5632 M.C. L M.C. L.5632 M.C. L M.C. DRIVE STAR NORTH STAR NORTH NORTH DRIVE N URY T NORTON PROV N RRONOUS NORTON NVRTNTY PROV. SPY S NY TY OR UT T TY RY OS NOT URNT T S TT T NORTON PROV S ORRT, NSR S POSS, VRY ORT S N ON N T S T TY RY. TS NORTON S N OP RO RORS RT SU "" YW No.

More information

Isomorphism In Kinematic Chains

Isomorphism In Kinematic Chains Intrntonl Journl o Rsr n Ennrn n Sn (IJRES) ISSN (Onln): 0-, ISSN (Prnt): 0- www.rs.or Volum Issu ǁ My. 0 ǁ PP.0- Isomorpsm In Knmt Cns Dr.Al Hsn Asstt.Prossor, Dprtmnt o Mnl Ennrn, F/O- Ennrn & Tnoloy,

More information

MATERIAL SEE BOM ANGLES = 2 > 2000 DATE MEDIUM FINISH

MATERIAL SEE BOM ANGLES = 2 > 2000 DATE MEDIUM FINISH NOTS:. LN MTN SUR WT NTUR/SOPROPYL LOOL PROR TO RN L OR LOO. PPLY LOTT 4 ON TRS. TORQU TO. Nm / 00 lb-in 4. TORQU TO 45-50 Nm / - lb-ft 5. TORQU TO Nm / 4.5 lb-ft. TORQU TO 0 Nm / lb-in. TORQU TO 5.5 Nm

More information

A Gentle Introduction to Matroid Algorithmics

A Gentle Introduction to Matroid Algorithmics A Gntl Introuton to Mtro Alortms Mtts F. Stllmnn Aprl, 06 Mtro xoms T trm mtro ws rst us n 9 y Hsslr Wtny []. ovrvw oms rom t txtooks o Lwlr [] n Wls []. Most o t mtrl n ts A mtro s n y st o xoms wt rspt

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

Straight-line Grid Drawings of 3-Connected 1-Planar Graphs

Straight-line Grid Drawings of 3-Connected 1-Planar Graphs Strt-ln Gr Drwns o 3-Connt 1-Plnr Grs M. Jwrul Alm 1, Frnz J. Brnnur 2, n Stn G. Koourov 1 1 Drtmnt o Comutr Sn, Unvrsty o Arzon, USA {mlm, koourov}@s.rzon.u 2 Unvrsty o Pssu, 94030 Pssu, Grmny rnn@normtk.un-ssu.

More information

DOCUMENT STATUS: LA-S5302-XXXXS LA, SSS, TRICEPS EXTENSION VERY

DOCUMENT STATUS: LA-S5302-XXXXS LA, SSS, TRICEPS EXTENSION VERY RVSON STORY RV T SRPTON O Y //0 RLS OR PROUTON T LN MR ----- L /0/0 UPT SN N OMPONNTS US: S 3-03 (*N TWO PLS ONLY) WS 3-5, PRT 3-00 TO SSMLY. T OLLOWN UPT: 3-30, 3-403, 3-403, 3-40, 3-45, 3-4, 3-5. 30

More information

Priority Search Trees - Part I

Priority Search Trees - Part I .S. 252 Pro. Rorto Taassa oputatoal otry S., 1992 1993 Ltur 9 at: ar 8, 1993 Sr: a Q ol aro Prorty Sar Trs - Part 1 trouto t last ltur, w loo at trval trs. or trval pot losur prols, ty us lar spa a optal

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

( ) ( ) ( ) 0. Conservation of Energy & Poynting Theorem. From Maxwell s equations we have. M t. From above it can be shown (HW)

( ) ( ) ( ) 0. Conservation of Energy & Poynting Theorem. From Maxwell s equations we have. M t. From above it can be shown (HW) 8 Conson o n & Ponn To Fo wll s quons w D B σ σ Fo bo n b sown (W) o s W w bo on o s l us n su su ul ow ns [W/ ] [W] su P su B W W 4 444 s W A A s V A A : W W R o n o so n n: [/s W] W W 4 44 9 W : W F

More information

Fun sheet matching: towards automatic block decomposition for hexahedral meshes

Fun sheet matching: towards automatic block decomposition for hexahedral meshes DOI 10.1007/s00366-010-0207-5 ORIGINAL ARTICLE Fun st mtn: towrs utomt lok omposton or xrl mss Nols Kowlsk Frnk Loux Mttw L. Sttn Stv J. Own Rv: 19 Frury 2010 / Apt: 22 Dmr 2010 Ó Sprnr-Vrl Lonon Lmt 2011

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

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

DOCUMENT STATUS: CORE HEALTH & FITNESS, LLC IL-D2002-XXAAX IP,DUAL ADJUSTIBLE PULLEY MATERIAL SEE BOM FINISH N/A N/A SHEET SIZE: B SCALE: 1:33.

DOCUMENT STATUS: CORE HEALTH & FITNESS, LLC IL-D2002-XXAAX IP,DUAL ADJUSTIBLE PULLEY MATERIAL SEE BOM FINISH N/A N/A SHEET SIZE: B SCALE: 1:33. NOTS: RVSON STORY RV T SRPTON O Y //04 RLS OR PROUTON 433 P 34 55 033 OUMNT STTUS: NOT O PROPRTRY NORMTON TS OUMNT SLL NOT RPROU NOR SLL T NORMTON ONTN RN US Y OR SLOS TO OTR XPT S XPRSSLY UTORZ Y OR LT

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

b.) v d =? Example 2 l = 50 m, D = 1.0 mm, E = 6 V, " = 1.72 #10 $8 % & m, and r = 0.5 % a.) R =? c.) V ab =? a.) R eq =?

b.) v d =? Example 2 l = 50 m, D = 1.0 mm, E = 6 V,  = 1.72 #10 $8 % & m, and r = 0.5 % a.) R =? c.) V ab =? a.) R eq =? xmpl : An 8-gug oppr wr hs nomnl mtr o. mm. Ths wr rrs onstnt urrnt o.67 A to W lmp. Th nsty o r ltrons s 8.5 x 8 ltrons pr u mtr. Fn th mgntu o. th urrnt nsty. th rt vloty xmpl D. mm,.67 A, n N 8.5" 8

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

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

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

Face Detection and Recognition. Linear Algebra and Face Recognition. Face Recognition. Face Recognition. Dimension reduction

Face Detection and Recognition. Linear Algebra and Face Recognition. Face Recognition. Face Recognition. Dimension reduction F Dtto Roto Lr Alr F Roto C Y I Ursty O solto: tto o l trs s s ys os ot. Dlt to t to ltpl ws. F Roto Aotr ppro: ort y rry s tor o so E.. 56 56 > pot 6556- stol sp A st o s t ps to ollto o pots ts sp. F

More information

Introduction to Fourier optics. Textbook: Goodman (chapters 2-4) Overview:

Introduction to Fourier optics. Textbook: Goodman (chapters 2-4) Overview: Introuton to ourr opts Ttbook: Goon (ptrs -) Ovrv: nr n nvrnt ssts T ourr trnsor Slr rton rsnl n runor pprotons. . nr ssts n ourr trnsor tutorl (rnr) sst onnts n nput to n output su tt: It s s to b lnr

More information

PRECAST APPROACH SLAB NOTES

PRECAST APPROACH SLAB NOTES ULNS TS ULN RWNS RPRSNT TYPL TLS OR T SN N TLN O PRST PPRO SLS. TS STS R NLU TO PROV N XMPL O T RTN LYOUT O TYPL PRST PPRO SL. TWO RNT PPRO SL SYSTMS R SOWN: SUR PPRO SLS: SLS TT R PL WT T TOP SUR T OR

More information

DOCUMENT STATUS: MINTP0 E-ST5080, BASE, NO DISPLAY VENDOR: 15.5 INCH MATERIAL SEE BOM FINISH REVISION HISTORY ITEM NO. PART NUMBER DESCRIPTION

DOCUMENT STATUS: MINTP0 E-ST5080, BASE, NO DISPLAY VENDOR: 15.5 INCH MATERIAL SEE BOM FINISH REVISION HISTORY ITEM NO. PART NUMBER DESCRIPTION RV T RVSON STORY SRPTON O Y 0-0-0 PROUTON RLS K. N NOTS:. SRL LL NORMTON: a) VOLTS: V b) MPS:.0 c) YLS: N/ d) WTTS: W e) PS: N/ f) PX #: PX. RTTON LOOS: S / / LN R WT SOPROPYL LOLOL PROR TO PLN.. PK M:

More information

kd-trees Idea: Each level of the tree compares against 1 dimension. Let s us have only two children at each node (instead of 2 d )

kd-trees Idea: Each level of the tree compares against 1 dimension. Let s us have only two children at each node (instead of 2 d ) k-trs CMSC 420 k-trs Invnt n 1970s Jon Bntl Nm ornll mnt 3-trs, 4-trs, t wr k ws t # o mnsons Now, popl s k-tr o mnson I: E lvl o t tr omprs nst 1 mnson. Lt s us v onl two lrn t no (nst o 2 ) k-trs E lvl

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

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

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

MINI POST SERIES BALUSTRADE SYSTEM INSTALLATION GUIDE PRODUCT CODE: MPS-RP

MINI POST SERIES BALUSTRADE SYSTEM INSTALLATION GUIDE PRODUCT CODE: MPS-RP MN POST SRS LUSTR SYSTM NSTLLTON U PROUT O: MPS-RP 0 R0 WLL LN 0 RONT LVTON VW R0 N P 0 T RUR LOK LOT ON LSS. SLON SL TYP. OT SS 000 LSS T 0 00 SRS LSS WT 00/00 (0mm NRMNTS VLL) MX. 000 00-0 (ROMMN) 00

More information

A New Interface to Render Graphs Using Rgraphviz

A New Interface to Render Graphs Using Rgraphviz A Nw Intr to Rnr Grps Usn Rrpvz Florn Hn Otor 30, 2017 Contnts 1 Ovrvw 1 2 Introuton 1 3 Dult rnrn prmtrs 3 3.1 Dult no prmtrs....................... 4 3.2 Dult prmtrs....................... 6 3.3 Dult

More information

Catalytic S N Ar of Unactivated Aryl Chlorides ESI

Catalytic S N Ar of Unactivated Aryl Chlorides ESI Eltron Supplmntry Mtrl (ESI) or CmComm. Ts journl s T Royl Soty o Cmstry 2014 Ctlyt S Ar o Untvt Aryl Clors ESI Tl o Contnts 1. Prour n Full Tl o Contons - Prour S1 - Intl solvnt srn (no tlyst) - Solvnt

More information

PR D NT N n TR T F R 6 pr l 8 Th Pr d nt Th h t H h n t n, D D r r. Pr d nt: n J n r f th r d t r v th tr t d rn z t n pr r f th n t d t t. n

PR D NT N n TR T F R 6 pr l 8 Th Pr d nt Th h t H h n t n, D D r r. Pr d nt: n J n r f th r d t r v th tr t d rn z t n pr r f th n t d t t. n R P RT F TH PR D NT N N TR T F R N V R T F NN T V D 0 0 : R PR P R JT..P.. D 2 PR L 8 8 J PR D NT N n TR T F R 6 pr l 8 Th Pr d nt Th h t H h n t n, D.. 20 00 D r r. Pr d nt: n J n r f th r d t r v th

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

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

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

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

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

H NT Z N RT L 0 4 n f lt r h v d lt n r n, h p l," "Fl d nd fl d " ( n l d n l tr l t nt r t t n t nt t nt n fr n nl, th t l n r tr t nt. r d n f d rd n t th nd r nt r d t n th t th n r lth h v b n f

More information

Telecommunications 1-1/4" RACEWAY WITH DOUBLE-GANG ADAPTER PLATE AND A/V CABLING.

Telecommunications 1-1/4 RACEWAY WITH DOUBLE-GANG ADAPTER PLATE AND A/V CABLING. 2 3 2 TNOOY SYMO ST NR TNOOY NOTS: NOT: This is a standard symbol list and not all items listed may be used. bbreviations () XSTN OV NS OOR NMW - UNRROUN ONUT T TORY ONTRTOR URNS ONTRTOR NST O ONTRTOR

More information

D t r l f r th n t d t t pr p r d b th t ff f th l t tt n N tr t n nd H n N d, n t d t t n t. n t d t t. h n t n :.. vt. Pr nt. ff.,. http://hdl.handle.net/2027/uiug.30112023368936 P bl D n, l d t z d

More information

Verification of DAG Structures in Cooperative Belief Network Based Multi-agent Systems

Verification of DAG Structures in Cooperative Belief Network Based Multi-agent Systems Vrton o AG Struturs n Cooprtv B Ntwor Bs Mut-nt Systs Y. Xn prtnt o Coputr Sn, Unvrsty o Rn Rn, Sstwn, Cn S4S 0A, yxn@s.urn. Astrt Mutpy ston Bysn ntwors (MSBNs) prov rwor or prost rsonn n opx sn usr ornt

More information

l f t n nd bj t nd x f r t l n nd rr n n th b nd p phl t f l br r. D, lv l, 8. h r t,., 8 6. http://hdl.handle.net/2027/miun.aey7382.0001.001 P bl D n http://www.hathitrust.org/access_use#pd Th r n th

More information

4 4 N v b r t, 20 xpr n f th ll f th p p l t n p pr d. H ndr d nd th nd f t v L th n n f th pr v n f V ln, r dn nd l r thr n nt pr n, h r th ff r d nd

4 4 N v b r t, 20 xpr n f th ll f th p p l t n p pr d. H ndr d nd th nd f t v L th n n f th pr v n f V ln, r dn nd l r thr n nt pr n, h r th ff r d nd n r t d n 20 20 0 : 0 T P bl D n, l d t z d http:.h th tr t. r pd l 4 4 N v b r t, 20 xpr n f th ll f th p p l t n p pr d. H ndr d nd th nd f t v L th n n f th pr v n f V ln, r dn nd l r thr n nt pr n,

More information