Straight-line Grid Drawings of 3-Connected 1-Planar Graphs
|
|
- Corey Eaton
- 6 years ago
- Views:
Transcription
1 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, Pssu, Grmny rnn@normtk.un-ssu. Astrt. A r s 1-lnr t n rwn n t ln su tt s ross t most on. In nrl, 1-lnr rs o not mt strtln rwns. W sow tt vry 3-onnt 1-lnr r s strt-ln rwn on n ntr r o urt sz, wt t xton o snl on t outr tt s on n. T rwn n omut n lnr tm rom ny vn 1-lnr mn o t r. 1 Introuton Sn Eulr s Könsr r rolm tn k to 1736, lnr rs v rov ntrstn rolms n tory n n rt. Fáry, Stn n Wnr rov nnntly tt vry lnr r s strt-ln lnr rwn [16, 24, 28]. Usn t lort tnus o nonl orrn n Snyr rlzrs, ts rsults wr mrov to strt-ln rwn on r o urt sz, n su rwns n omut n lnr tm [9, 23]. T r oun s symtotlly otml, sn t nst trnl rs r lnr rs n rur Ω(n 2 ) r [11]. T rwn lortms wr rn to mrov t r rurmnt or to mt onvx rrsnttons,.., wr nnr s onvx [5, 8, 19] or strtly onvx [1]. Howvr, most rs r nonlnr n rntly, tr v n mny ttmts to stuy lrr lsss o rs. O rtulr ntrst r 1-lnr rs, w n sns r on st yon lnr rs. Ts wr ntrou y Rnl [22] n n ro to olor lnr r n ts ul. Altou t s known tt 3-onnt lnr r n ts ul v strt-ln 1-lnr rwn [27] n vn on r o urt sz [14], lttl s known out nrl 1-lnr rs. It s NP-r to ronz 1-lnr rs [17, 20] n nrl, ltou tr s lnr-tm tstn lortm [12] or mxml 1-lnr rs (.., wr no tonl n wtout voltn 1-lnrty) vn t t rulr orrn o nnt s roun vrtx. A 1-lnr r wt n vrts s t most 4n 8 s [4, 15, 21] n ts ur oun s tt. On t otr n strt-ln rwns o 1-lnr rs my v t most 4n 9 s n ts oun s tt [10]. Hn not ll 1-lnr rs mt strt-ln rwns. Unlk lnr rs, mxml 1-lnr rs n mu srsr wt only 2.64n s [6]. Tomssn [26] rrs to 1-lnr rs s rs wt ross nx 1 n rov tt n m 1-lnr r n turn nto strt-ln rwn n only t xlus B- n W -onurtons; s F. 2. Ts orn onurtons wr
2 () () () () F. 1. () () A 3-onnt 1-lnr r n ts strt-ln r rwn (wt on n n on ), () () notr 3-onnt 1-lnr r n ts strt-ln r rwn. rst sovr y Elton [13] n us y Hon t l. [18], wo sow tt t onurtons n tt n lnr tm t mn s vn. Ty lso rov tt tr s lnr tm lortm to onvrt 1-lnr mn wtout B- n W - onurtons nto strt-ln rwn, ut wtout ouns or t rwn r. In ts r w sttl t strt-ln r rwn rolm or 3-onnt 1- lnr rs. Frst w omut norml orm or n m 1-lnr rs wt no B-onurton n t most on W -onurton on t outr. Tn, tr umntn t r wt s mny lnr s s ossl n tn ltn t rossn s, w n 3-onnt lnr r, w s rwn wt strtly onvx s usn n xtnson o t lortm o Crok n Knt [8]. Fnlly t rs o rossn s r rnsrt nto t onvx s. Ts vs strt-ln rwn on r o urt sz wt t xton o snl on t outr, w my n on n (n ts xton s unvol); s F. 1. In ton, t rwn s otn n lnr tm rom vn 1-lnr mn. 2 Prlmnrs W onsr sml unrt rs G = (V, E) wt n vrts n m s. A rwn o r s mn o G nto t ln su tt t vrts r m to stnt onts n s Jorn r twn ts nonts. A rwn s lnr t Jorn rs o t s o not ross n t s 1-lnr s ross t most on. Not tt rossns twn s nnt to t sm vrtx r not llow. For xml, K 5 n K 6 r 1-lnr rs. An mn o r s lnr (rs. 1-lnr) t mts lnr (rs. 1-lnr) rwn. An mn ss t s, w r toololly onnt rons. T unoun s t outr. A n lnr r s s y yl sun o s on ts ounry (or uvlntly y t yl sun o t nonts o t s). Aornly, 1-lnr mn E(G) ss t s n 1-lnr rwn o G nlun t outr. A 1-lnr mn s wtnss or 1-lnrty. In rtulr, E(G) srs t rs o rossn s n t s wr t s ross. E r o rossn s (, ) n (, ) nus rossn ont. Cll t smnt o n twn t vrtx n t rossn ont l-. E l s mrml, nloous to t s n lnr rwns, n t sns tt no n ross su l- wtout voltn t 1-lnrty o t mn. T non-ross s r ll lnr. A lnrzton G s otn rom E(G) 2
3 () () () F. 2. () An umnt X-onurton, () n umnt B-onurton, () n umnt W -onurton. T rs nu y t sol s r ll n X-onurton (), B-onurton (), n W -onurton (). y usn t rossn onts s rulr vrts n rln rossn y ts two l-s. A 1-lnr mn E(G) n ts lnrzton sr uvlnt mns, n s vn y lst o s n l-s nn t, or uvlntly, y lst o vrts n rossn onts o t s n l s. Elton [13] rs t rolm o ronzn 1-lnr rs wt rtlnr rwns. H solv ts rolm or outr-1-lnr rs (1-lnr rs wt ll vrts on t outr-yl) n roos tr orn onurtons. Tomssn [26] solv Elton s rolm n rtrz t rtlnr 1-lnr mns y t xluson o B- n W-onurtons; s F. 2. Hon t l. [18], otn smlr rtrzton wr t B- n W -onurtons r ll t Bulr n Gu rs. Ty lso sow tt ll ourrns o ts onurtons n omut n lnr tm rom vn 1-lnr mn. Dnton 1. Consr 1-lnr mn E(G): A B-onurton onssts o n (, ) n two s (, ) n (, ) w ross n som ont su tt n l n t ntror o t trnl (,, ). Hr (, ) s ll t s o t onurton. An X-onurton onssts o r (, ) n (, ) o rossn s w os not orm B-onurton. A W-onurton onssts o two rs o s (, ), (, ) n (, ), (, ) w ross n onts n, su tt,,, l n t ntror o t urnl,,,. Hr n t (,, ), rsnt s t s. Osrv tt or ll ts onurtons t s s my ross y notr, wrs t rossn s r mrml; s F 2. Tomssn [26] n Hon t l. [18] rov tt or 1-lnr mn to mt strt-ln rwn, B- n W -onurtons must xlu: Prooston 1. A 1-lnr mn E(G) mts strt-ln rwn wt toololly uvlnt mn n only t os not ontn B- or W -onurton. Aumnt vn 1-lnr mn E(G) y n s mny s to E(G) s ossl so tt G rmns sml r n t nwly s r lnr n E(G). W ll su n mn lnr-mxml mn o G n t orton 3
4 lnr-mxml umntton. (Not tt Hon t l. [18] olor t lnr s o 1- lnr mn s r n ll lnr-mxml umntton r umntton.) T lnr sklton P(E(G))) onssts o t lnr s o lnr-mxml umntton. It s lnr m r, sn ll rs o rossn s r omtt. Not tt t lnr umntton n t lnr sklton r n or n mn, not or r. A r my v rnt mns w v rs to rnt onurtons n umnttons. T noton o lnr-mxml mn s rnt rom t notons o mxml 1-lnr mns n mxml 1-lnr rs, w r su tt t ton o ny volts 1-lnrty (or smlty) [6]. T ollown lm, rovn n mny rlr rs [6, 15, 18, 25, 26], sows tt rossn r o s nus K 4 n lnr-mxml mn, sn mssn s o K 4 n wtout nun nw rossns. Lmm 1. Lt E(G) lnr-mxml 1-lnr mn o r G n lt (, ) n (, ) two rossn s. Tn t our vrts {,,, } nu K 4. By Lmm 1, or lnr-mxml mn X-, B, n W -onurton s umnt y tonl s. Hr w n ts umnt onurtons. Dnton 2. Lt E(G) lnr-mxml 1-lnr mn o r G. An umnt X-onurton onssts o K 4 wt vrts (,,, ) su tt t s (, ) n (, ) ross ns t urnl. An umnt B-onurton onssts o K 4 wt vrts (,,, ) su tt t s (, ) n (, ) ross yon t ounry o t urnl. An umnt W-onurton onssts o two K 4 s (,,, ) n (,,, ) on o w s n n umnt X-onurton n t otr n n umnt B-onurton. For n umnt X- or umnt B-onurton, t s not nun rossn wt otr s n t onurton ns yl, w ll t t sklton. In onurton, t s on t outr-ounry o t m onurton n not nun rossn wt otr s n t onurton r t s s. Usn t rsults o Tomssn [26] n Hon t l. [18], w n now rtrz wn lnr-mxml 1-lnr mn o r mts strt-ln rwn: Lmm 2. Lt E(G) lnr-mxml 1-lnr mn o r G. Tn tr s strt-ln 1-lnr rwn o G wt toololly uvlnt mn s n E(G) n only E(G) os not ontn n umnt B-onurton. Proo. Assum tt E(G) ontns n umnt B-onurton. Tn t must ontn B-onurton n s no strt-ln 1-lnr rwn u to Prooston 1. Convrsly, E(G) s no strt-ln 1-lnr rwn tn y t ontns t lst on B- or W -onurton. Sn Γ s lnr-mxml mn, y Lmm 1 rossn r n E(G) nus K 4. Tus t ott s n F. 2() () must rsnt n ny B- or W - onurton, nun n umnt B-onurton. T norml orm or n m 1-lnr r E(G) s otn y rst n t our lnr s to orm K 4 or r o rossn wl routn tm losly to t rossn s n tn rmovn ol ult s nssry. Su 4
5 n mn o 1-lnr r s norml mn o t. A norml lnrmxml umntton or n m 1-lnr r s otn y rst nn norml orm o t mn n tn y lnr-mxml umntton. Lmm 3. Gvn 1-lnr mn E(G), t norml lnr-mxml umntton o E(G) n omut n lnr tm. Proo. Frst umnt rossn o two s (, ) n (, ) to K 4, su tt t s (, ), (, ), (, ), (, ) r n n s o ult t ormr s rmov. Tn ll umnt X-onurtons r mty n ontn no vrts ns tr skltons. Nxt trnult ll s w o not ontn l-, rossn, or rossn ont. E st n on n lnr tm. 3 Crtrzton o 3-Connt 1-Plnr Grs Hr w rtrz 3-onnt 1-lnr rs y norml mn, wr t rossns r umnt to K 4 s su tt t rsultn umnt X-onurtons v vrtx-mty skltons n tr s no umnt B-onurton xt or t most on umnt W-onurton wt r o rossn s n t outr. Lt E(G) 1-lnr mn o r G. E r o rossn s nus rossn ont n t rossn s n tr l-s r mrml s ty nnot ross y otr s wtout voltn 1-lnrty. An mrml t n E(G) s n ntrnlly-sont sun P = v 1, 1, v 2, 2,..., v n, n, v n+1, wr v 1, v 2,..., v n+1 r (rulr) vrts o G, 1, 2,..., n r rossn onts n E(G) n (v, ), (, v +1 ) or {1, 2,..., n} r l s. I v n+1 = v 0, tn P s n mrml yl. An mrml yl s srtn wn t s vrts ot ns n outs o t, sn ltn ts vrts sonnts G. Lmm 4. Lt G = (V, E) 3-onnt 1-lnr r wt lnr-mxml 1-lnr mn E(G). Tn t ollown ontons ol. A. () Two umnt B-onurtons or two umnt X-onurtons nnot on t sm s o ommon s. () Suos n umnt B-onurton B n n umnt X-onurton X r on t sm s o ommon s (, ). Lt n t rossn onts or X n B, rstvly n lt R(X) n R(B) t rons ns t skltons o X n B. Tn ll vrts o V \ {, } r ns t mrml yl R(X) R(B); otrws ll vrts o V \ {, } r outs t mrml yl. B. () I two umnt B-onurtons r on oost ss o ommon s (, ), wt rossn onts n, rstvly, tn ll t vrts o V \ {, } r ns t mrml yl. () I two umnt X-onurtons r on oost ss o ommon s (, ), wt rossn onts n, rstvly, tn ll t vrts o V \ {, } r outs t mrml yl. () An umnt B-onurton n n umnt X-onurton nnot sr ommon s rom oost ss. Proo. Conton A.() n B.() ol us o ts onurtons nus srtn mrml yl n E(G) wt only two (rulr) vrts rom G, 5
6 () () () () () () () F. 3. Illustrton or t roo o Lmm 4. ontrton wt t 3-onntvty o G; s F. 3() () n (). Smlrly, ny o t Contons A.() n B.() () s not sts, tn t mrml yl oms srtn n n t r {, } oms srton r o G, n ontrton wt t 3-onntvty o G; s F. 3() (), () n (). Corollry 1. Lt G 3-onnt 1-lnr r wt lnr-mxml 1-lnr mn E(G). Tn no tr rossn -rs n E(G) sr t sm s. Proo. E rossn r nus tr n umnt B- or n umnt X- onurton. Ts t lon wt Lmm 4[A.(), B.()] yls t orollry. Lmm 5. Lt G 3-onnt 1-lnr r. Tn tr s lnr-mxml 1-lnr mn E(G ) o sur-r G o G su tt E(G ) ontns t most on umnt W-onurton n no otr umnt B-onurton, n umnt X-onurton n E(G ) ontns no vrtx ns ts sklton. Proo. Lt E(G) 1-lnr mn o G. W lm tt y norml lnrmxml umntton o E(G) w t t sr mn o surr o G. Not tt u to t -rroutn ts orton onvrts ny B-onurton wos s s not sr wt notr onurton nto n X-onurton; s F. 4(). On t otr n s s sr y two B-onurtons, ty r onvrt nto on W -onurton n y Lmm 4 ts W -onurton must on t outr; s F. 4(). By Corollry 1, s nnot sr y mor tn two umnt B onurtons. Furtrmor ts orton os not rt ny nw B-onurtons. It lso mks t sklton o ny umnt X-onurton vrtx-mty, sn y Lmm 4 t sm s n sr y t most two umnt X-onurtons rom t oost s n n s t s sr y two umnt X-onurton, t ntror o t nu mrml yl s mty; s F. 4(). Lmm 5 totr wt Prooston 1 mls t ollown: Torm 1. A 3-onnt 1-lnr r mts strt-ln 1-lnr rwn xt or t most on n t outr. 6
7 () () () F. 4. Illustrton or t roo o Lmm 5. 4 Gr Drwns In t rvous ston w sow tt 3-onnt 1-lnr r s strt-ln 1-lnr rwn, wt t xton o snl n t outr, w oms rom n unvol W-onurton. W now strntn ts rsult n sow tt tr s strt-ln r rwn wt O(n 2 ) r, w n onstrut n lnr tm rom vn 1-lnr mn. T lortm tks n mn E(G) n omuts norml lnr-mxml umntton. Consr t lnr sklton P(E(G)) or t mn. I tr s n umnt W-onurton n rossn n t outr, on rossn on t outr s kt n t otr rossn s trt srtly. Tus t outr o P(E((G)) s trnl n t nnr s r trnls or urnls. E urnl oms rom n umnt X-onurton. It must rwn strtly onvx, su tt t rossn s n r-nsrt. Ts s v y n xtnson o t onvx r rwn lortm o Crok n Knt [8], w tsl s n xtnson o t stn mto o Fryssx, P n Pollk [9]. Sn t s r t most urnls, w n vo tr ollnr vrts n t nrton to trnl y n xtr unt st. Not tt our lortm vs O(n 2 ) r, wl t nrl lortms or strtly onvx r rwns [1, 7] rur lrr r, sn strtly onvx rwns o n-ons n Ω(n 3 ) r [2]. T lortm o Crok n Knt n n rtulr t omutton o nonl omoston rsums 3-onnt lnr r. Tus t lnr sklton o 3- onnt 1-lnr r must 3-onnt, w ols xt or t K 4, wn t s m s n umnt X-onurton. Ts rsults rllls t t tt t lnrzton o 3-onnt 1-lnr r s 3-onnt [15]. Lmm 6. Lt G r wt lnr-mxml 1-lnr mn E(G) su tt t s no umnt B-onurton n umnt X-onurton n E(G) s no vrtx ns ts sklton. Tn t lnr sklton P(E(G)) s 3-onnt. 7
8 W wll rov Lmm 6 y sown tt tr s no srton r n P(E(G)). Frst w otn lnr r H rom G s ollows. Lt (, ) n (, ) r o rossn s tt orm n umnt X-onurton X n Γ. W tn lt t two s (, ), (, ); vrtx u n t s (, u), (, u), (, u), (, u) to trnult t. Cll v ross-vrtx n ll ts orton ross-vrtx nsrton on X. W tn otn H rom G y ross-vrtx nsrton on umnt X-onurton. Cll H lnrzton o G n not t st o ll t ross-vrts y U. Tn P(E(G)) = H \U. Bor rovn Lmm 6 w onsr svrl rorts o H, t lnrzton o t 1-lnr r. Lmm 7. Lt G = (V, E) r wt lnr-mxml 1-lnr mn E(G) su tt E(G) ontns no umnt B-onurton n umnt X- onurton n E(G) ontns no vrtx ns ts sklton. Lt H lnrzton o G, wr U s t st o ross-vrts. Tn t ollown ontons ol. () H s mxml lnr r (xt H s t K 4 n n X-onurton) () E vrtx o U s r 4. () U s n nnnt st o H. () Tr s no srtn trnl o H ontnn ny vrtx rom U. () Tr s no srtn 4-yl o H ontnn two vrts rom U. Proo. For onvnn, w ll vrtx n V U rulr vrtx. () Sn H s lnr r, y nton w only n to sow tt o H s trnl. E rossn r n Γ nus n umnt X-onurton wos sklton s no vrtx n ts ntror. Tror o H ontnn rossn vrtx s trnl. On t otr n, Hon t l. [18] sow tt n ny lnr-mxml 1-lnr mn ontnn no rossn vrts s trnl. Tus H s mxml lnr r. () () Ts two ontons ollow rom t t tt t noroo o rossn vrtx onssts o xtly our rulr vrts tt orm t sklton o t orrsonn umnt X-onurton. () For ontrton suos vrtx u U rtts n srtn trnl T o H. Sn t noroo o u orms t sklton o t orrsonn umnt X-onurton X, t otr two vrts, sy n, n T r rulr vrts. T (, ) nnot orm s or X, sn t, tn t ntror o t srtn trnl T woul ontn n t ntror o t sklton or X n n woul mty. Assum tror tt n r not onsutv on t sklton o X. In ts s t (, ) s rossn n G n n s n lt wn onstrutn H; s F. 5(). () Suos two vrts u, v U rtt n srtn 4-yl o H. Du to Conton (), ssum wtout loss o nrlty tt t srtn 4-yl s T = uv, wr, r rulr vrts. Assum rst tt t two vrts, r nt n H n lso ssum wtout loss o nrlty tt t (, ) s rwn ns t ntror o T. Ts mns tt t ntror o t lst on o t two trnls u n v s non-mty n n t lst on o ts two trnls orms srtn trnl n H, ontrton wt Conton (). W 8
9 () () F. 5. Illustrton or t roo o Lmm 6. tus ssum tt t two vrts n r not nt n H. Tn or ot t umnt X-onurtons X n Y, orrsonn to t two rossn vrts u n v, t two vrts u n v r not onsutv on tr sklton. Ts mls tt t rossn (, ) rtts n two rnt umnt X- onurtons n Γ, n ontrton; s F. 5(). W r now ry to rov Lmm 6 Proo (Lmm 6). Assum or t uros o otnn ontrton tt P(E(G)) s not 3-onnt. Tn tr xsts som srton r {, } n P(E(G)). Lt H t lnrzton o G, wr U s t st o ross-vrts. Tn S = U {, } s srtn st or H. Tk mnml srtn st S S su tt no ror sust o S s srtn st or H. Sn H s mxml lnr r (rom Lmm 7()), S must orm srtn yl [3]. As H s mxml lnr r t must 3- onnt, w mls tt S 3. On t otr n, sn S ontns t most two rulr vrts, n no two ross-vrts n nt n H (Lmm 7()), S < 5. Hn S s tr srtn trnl or srtn 4-yl n H ontnn t most two rulr vrts; w t ontrton wt Lmm 7() (). Fnlly, w sr our lortm or strt-ln r rwns. Ts rwn lortm s s on n xtnson o t lortm o Crok n Knt [8] or omutn onvx rwn o lnr 3-onnt r. For onvnn w rr to ts lortm s t CK-lortm n w n wt r ovrvw. Lt G = (V, E) n m 3-onnt r n lt (u, v) n on t outr-yl o G. T CK-lortm strts y omutn nonl omoston o G, w s n orr rtton V 1, V 2,..., V t o V su tt t ollown ontons ol: () For k {1, 2,..., t}, t r G k nu y t vrts V 1... V k s 2-onnt n ts outr-yl C k ontns t (u, v). () G 1 s yl, V t s snlton {z}, wr z / {u, v} s on t outr-yl o G. () For k {2,..., t 1} t ollown ontons ol: I V k s snlton {z}, tn z s on t outr o G k 1 n s t lst on nor n G G k. I V k s n {z 1,..., z l }, z s t lst on nor n G G k, z 1, z l v on nor on C k 1 n no otr z s nors on G k 1. 9
10 For k {1, 2,..., t}, t vrts tt lon to V k v rnk k. W ll vrtx o G k sturt t s no nor n G G k. T CK-lortm strts y rwn t (u, v) wt orzontl ln-smnt o unt lnt. Tn or k = 1, 2,..., t, t nrmntlly omlts t rwn o G k. Lt C k 1 = {(u = w 1,..., w,..., w,..., w r = v)} wt 1 < r su tt w n w r t ltmost n t rtmost nor o vrts n V k. Tn t vrts o V k r l ov t vrts w,..., w. Assum tt V k = {z 1,..., z l }. Tn z 1 s l on t vrtl ln ontnn w w s sturt n G k ; otrws t s l on t vrtl ln on unt to t rt o w. On t otr n, z l s l on t ntv onl ln (.., wt 45 slo) ontnn w. I v k s snlton tn z = z 1 = z l s l t t ntrston o ts two lns. Otrws (tr nssry stn o w n otr vrts), t vrts z 1,... z l r l on onsutv vrtl lns on unt rt rom otr. In orr to mk sur tt ts stn orton os not stur lnrty or onvxty, vrtx v s ssot wt n unr-st U(v) n wnvr v s st, ll vrts n U(v) r lso st lon wt v. Tus t s twn vrts o ny U(v) r n sns r. Torm 2. Gvn 1-lnr mn E(G) o 3-onnt r G, strtln rwn on t (2n 2) (2n 3) r n omut n lnr tm. Only on on t outr my rur on n. Proo. Assum tt E(G) s norml lnr-mxml mn; otrws w omut on y norml lnr-mxml umntton n lnr tm y Lmm 3. Consr t lnr sklton P(E(G)). I tr s no unvol W-onurton on t outr o t mxml lnr umntton, tn t outr-yl o P(E(G)) s trnl. Otrws w on o t rossn s n t outr to P(E(G)) to mk t outr-yl trnl. T otr rossn s trt srtly. By Lmm 6, P(E(G)) s 3-onnt, ts outr s trnl (,, ) n t nnr s r trnls or urnls, wr t lttr rsult rom umnt X-onurtons n r n on-to-on orrsonn to rs o rossn s. W ws to otn lnr strt-ln r rwn o P(E(G)) su tt ll urnls r strtly onvx. Altou t CK-lortm rws ny 3-onnt lnr r o n vrts on r o sz (n 1) (n 1) wt onvx s, t s r not nssrly strtly onvx [8]. Hn w must moy t lortm so tt ll urnls r strtly onvx. Not tt y t ssnmnt o t unr-sts, t CK-lortm urnts tt on s rwn strtly onvx, t woul rmn strtly onvx tr ny susunt stn o vrts. For P(E(G)) V k s tr snl vrtx or r wt n, sn t s r t most urnls. I V k s n (z 1, z 2 ) tn, y t nton o t nonl omoston, xtly on urnl w z 1 z 2 w s orm n y onstruton ts s rwn onvx. W tus ssum tt V k ontns snl vrtx, sy v. Lt C k 1 = {(u = w 1,..., w,..., w,..., w r = v)} wt 1 < r su tt w n w r t ltmost n t rtmost nor o vrts n V k. Tn t nw s rt y t nsrton o v r ll rwn strtly onvx unlss tr s som urnl vw 1w w +1 wr < < n w 1, w, w +1 r ollnr n t rwn o G k 1. Not tt n ts s t vrtx w must sturt n G k 1. 10
11 Ts s my our n t CK-lortm only wn t ln ontnn w 1, w, w +1 s tr vrtl ln or ntv onl (wt 45 slo). In t ormr s, w 1 soul v lso n sturt n G k 1, w s not ossl sn v s ts nor. Tus t s sunt to mk sur tt no sturt vrtx o G k s n t ntv onl o ot ts lt n rt nor on C k. W o ts y t ollown xtnson o t CK-lortm. Suos tt v s l ov w wt slo 45 n w ws l ov ts rtmost lowr nor w wt slo 45, n tr s t urnl (v, w, w, u) or som vrtx u wt r rnk (.., w wll l ltr). Tn st w y on xtr unt to t rt wn v or u s l. Ts mls n t w n sts strtly onvx nl ov w. T CK-lortm strts y ln t rst two vrts on unt wy n t rurs unt st to t rt or ollown vrtx. On t otr n, 1-lnr r s t most n 2 rs o rossn s. Hn, tr r n 3 umnt X-onurtons, o w nus urnl n t lnr sklton. Tus t wt n t r n 1 +, w s oun y 2n 4. T vrts,, o t outr trnl r l t t r onts (0, 0), (0, n 1 + ), (n 1 +, 0). In s t ornl r n unvol W -onurton n t outr, w n ost-rossn s to to t rwn t xtr (, ), w nus rossn n t outr wt t (, ). Sn s t ltmost lowr nor o wn s l n s not sturt, s l n t rst olumn t (1, ) or som < n 2 +. St on unt to t rt, nsrt n ont t ( 1, n + ) ust on onl unt lt ov n rout t (, ) v t n ont. Fur 6 n t nx llustrts t orton o t lortm or omutn strt-ln rwn o 3-onnt 1-lnr r on (2n 2) (2n 3) r. 5 Conluson n Futur Work W v sown tt 3-onnt 1-lnr rs n m on t O(n) O(n) ntr r, so tt s r rwn s strt-ln smnts (xt or t most on on t outr tt rurs n). Morovr, t lortm s sml n runs n lnr tm. Som 1-lnr m rs my rur xonntl r; s Hon t l. [18]. As w v sown, ts nnot n wt 3-onnt 1-lnr rs. It s not lr wtr tr xst onnt 1-lnr rs or w ny strtln 1-lnr rwn rurs xonntl r. Ronton o 1-lnr rs s NPr [20]. How r s t ronton o lnr-mxml 1-lnr rs? Rrns 1. I. Bárány n G. Rot. Strtly onvx rwns o lnr rs. Doumnt Mtmt, 11: , I. Bárány n N. Tokus. T mnmum r o onvx ltt n-ons. Comntor, 24(2): , I. Byrs. On k-t mltonn mxml lnr rs. Dsrt Mtmts, 40(1): , R. Bonk, H. Sumr, n K. Wnr. Bmrkunn zu nm Ssrnrolm von G. Rnl. A. us m Mt. Smnr r Unv. Hmur, 53:41 52,
12 5. N. Bonon, S. Flsnr, n M. Mos. Convx rwns o 3-onnt ln rs. Alortm, 47(4): , F.-J. Brnnur, D. Estn, A. Glßnr, M. T. Goor, K. Hnur, n J. Rslur. On t nsty o mxml 1-lnr rs. In Gr Drwn (GD 12), volum 7704 o Ltur Nots n Comutr Sn, s Srnr, M. Crok, M. T. Goor, n R. Tmss. Convx rwns o rs n two n tr mnsons. In Symosum on Comuttonl Gomtry (SoCG 96), s , M. Crok n G. Knt. Convx r rwns o 3-onnt lnr rs. Intrntonl Journl o Comuttonl Gomtry n Altons, 7(3): , H. Fryssx, J. P, n R. Pollk. How to rw lnr r on r. Comntor, 10(1):41 51, W. Dmo. Dnsty o strt-ln 1-lnr r rwns. Inormton Prossn Lttr, 113(7): , D. Dolv, T. Lton, n H. Trky. Plnr mn o lnr rs. In Avns n Comutn Rsr, s , P. Es, S.-H. Hon, N. Kto, G. Lott, P. Swtzr, n Y. Suzuk. Tstn mxml 1-lnrty o rs wt rotton systm n lnr tm. In Gr Drwn (GD 12), s , R. B. Elton. Rtlnr rwns o rs. Utlts Mt., 29: , C. Ertn n S. G. Koourov. Smultnous mn o lnr r n ts ul on t r. Tory o Comutn Systms, 38(3): , I. Fr n T. Mrs. T strutur o 1-lnr rs. Dsrt Mtmts, 307(7 8): , I. Fáry. On strt lns rrsntton o lnr rs. At Sntrum Mtmtrum, 11: , A. Grorv n H. L. Bolnr. Alortms or rs ml wt w rossns r. Alortm, 49(1):1 11, S.-H. Hon, P. Es, G. Lott, n S.-H. Poon. Fáry s torm or 1-lnr rs. In Intrntonl Conrn on Comutn n Comntors (COCOON 12), volum 7434 o Ltur Nots n Comutr Sn, s Srnr, G. Knt. Drwn lnr rs usn t nonl orrn. Alortm, 16:4 32, V. P. Korzk n B. Mor. Mnml ostrutons or 1-mmrsons n rnss o 1- lnrty tstn. Journl o Gr Tory, 72(1):30 71, J. P n G. Tót. Grs rwn wt w rossns r. Comntor, 17: , G. Rnl. En Ssrnrolm u r Kul. A. us m Mt. Smnr r Unv. Hmur, 29: , W. Snyr. Emn lnr rs on t r. In Symosum on Dsrt Alortms (SODA 90), s , S. K. Stn. Convx ms. Amrn Mtmtl Soty, 2(3): , Y. Suzuk. R-mns o mxmum 1-lnr rs. SIAM Journl o Dsrt Mtmts, 24(4): , C. Tomssn. Rtlnr rwns o rs. Journl o Gr Tory, 12(3): , W. T. Tutt. How to rw r. Pro. Lonon Mt. Soty, 13(52): , K. Wnr. Bmrkunn zum Vrrnrolm. Jrsrt r Dutsn Mtmtkr-Vrnun, 46:26 32,
13 Anx Illustrton o t Alortm or 3-Connt 1-lnr Gr () () () () () () F. 6. () A 3-onnt 1-lnr r G, () norml mn or G, () lnr-mxml norml mn E (G), () lnr sklton P(E (G)) omut rom E (G) y ltn t rossn s xt on rossn on t outr, () strt-ln strtly-onvx r rwn Γ o P(E (G)) usn n xtnson o t lortm n [8], n () r rwn Γ o G wt strt-ln s xt or on wt on n. 13
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 informationLecture 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 informationWeighted 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 informationCMSC 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 informationSpanning 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 informationCMPS 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 information5/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(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 informationTheorem 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 informationDepth 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 informationHaving 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(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 informationExam 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 informationClosed 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 informationIn 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 information4.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 informationDivided. 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 information2 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 informationImproving 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 informationApplications 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 informationMinimum 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 informationGraph 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 informationLecture 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 informationPlanar 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 informationd 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 informationThe 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 informationStrongly 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 informationMAT3707. 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 informationCSE 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 informationCSE 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 informationGraphs 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 informationMinimum 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 informationSingle 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 informationCOMP 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 informationOn 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 informationGrade 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 informationPlatform 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 informationMATERIAL 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 informationAn 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 information23 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 informationL.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 informationStraight-line Grid Drawings of 3-Connected 1-Planar Graphs
Stright-lin Gri Drwings o 3-Connt 1-Plnr Grhs M. Jwhrul Alm 1, Frnz J. Brnnurg 2, n Sthn G. Koourov 1 1 Drtmnt o Comutr Sin, Univrsity o Arizon, USA {mjlm, koourov}@s.rizon.u 2 Univrsity o Pssu, 94030
More informationPhylogenetic 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 informationPriority 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 informationMath 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 informationData-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 informationPaths. 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 informationOne-Dimensional Computational Topology
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
More informationA 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 informationDOCUMENT 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 informationDOCUMENT 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 informationCSE 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 informationThe 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 informationCycles 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 informationMATERIAL 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 informationMINI 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 informationMath 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 informationCHELOURANYAN CALENDAR FOR YEAR 3335 YEAR OF SAI RHAVË
CHELOURANYAN CALENDAR FOR YEAR YEAR OF SAI RHAVË I tou woust n unon wt our Motr, now tt tou st nvr t Hr. I tou woust sp t v o mttr, now tt tr s no mttr n no v. ~Cry Mry KEY TO CALENDAR T Dys o t W In t
More informationSAMPLE 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 information12/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 informationECE 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 information5/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 informationCS 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 information1 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 informationComputer Graphics. Viewing & Projections
Vw & Ovrvw rr : rss r t -vw trsrt: st st, rr w.r.t. r rqurs r rr (rt syst) rt: 2 trsrt st, rt trsrt t 2D rqurs t r y rt rts ss Rr P usuy st try trsrt t wr rts t rs t surs trsrt t r rts u rt w.r.t. vw vu
More informationPlanar 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 informationlearning 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 information17 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 informationDental 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 informationTangram 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 information23 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 informationDOCUMENT 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 informationGraphs. 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(4, 2)-Choosability of Planar Graphs with Forbidden Structures
Mtmtcs Publctons Mtmtcs 7-017 (4, )-Coosblty o Plnr Grps wt Forbn Structurs Znr Brkkyzy Iow Stt Unvrsty Crstopr Cox Crn Mllon Unvrsty Mcl Dryko Iow Stt Unvrsty, mryko@stt.u Krstn Honson Coloro Coll Mot
More informationA 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 informationT H E S C I E N C E B E H I N D T H E A R T
A t t R u r s - L x C t I. xtr turs t Lx Ct Rurs. Rr qurtr s s r t surt strutur. Ts Att Rurs rv ut us, s srt t tr t rtt rt yur t w yu ru. T uqu Lx st ut rv ss ts ss t t y rt t tys t r ts w wr rtts. Atrx
More informationOutline. 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 informationSheet Title: Building Renderings M. AS SHOWN Status: A.R.H.P.B. SUBMITTAL August 9, :07 pm
1 2 3 4 5 6 7 8 9 1 11 12 13 14 15 16 17 18 19 orthstar expressly reserves its common law copyright and other property rights for all ideas, provisions and plans represented or indicated by these drawings,
More information(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 informationConstructive 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 informationMaximum Matching Width: new characterizations and a fast algorithm for dominating set
Maxmum Matcn Wdt: nw caractrzatons and a ast alortm or domnatn st 정지수 (KAIST) jont work wt Sv Hortmo Sætr and Jan Arn Tll (Unvrsty o Brn) 1st Koran Worksop on Grap Tory 2015.8.27. KAIST Grap wdt paramtrs
More informationFL/VAL ~RA1::1. Professor INTERVI of. Professor It Fr recru. sor Social,, first of all, was. Sys SDC? Yes, as a. was a. assumee.
B Pror NTERV FL/VAL ~RA1::1 1 21,, 1989 i n or Socil,, fir ll, Pror Fr rcru Sy Ar you lir SDC? Y, om um SM: corr n 'd m vry ummr yr. Now, y n y, f pr my ry for ummr my 1 yr Un So vr ummr cour d rr o l
More informationPRECAST 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 informationELECTRONIC SUPPLEMENTARY INFORMATION
Elctronc Supplmntry Mtrl (ESI) or Polymr Cmstry. Ts ournl s T Royl Socty o Cmstry 2015 ELECTRONIC SUPPLEMENTARY INFORMATION Poly(lyln tcont)s An ntrstn clss o polystrs wt proclly loct xo-cn oul ons suscptl
More informationFunctions and Graphs 1. (a) (b) (c) (f) (e) (d) 2. (a) (b) (c) (d)
Functions nd Grps. () () (c) - - - O - - - O - - - O - - - - (d) () (f) - - O - 7 6 - - O - -7-6 - - - - - O. () () (c) (d) - - - O - O - O - - O - -. () G() f() + f( ), G(-) f( ) + f(), G() G( ) nd G()
More informationOpenMx 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 informationFace 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 informationGraphs. 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 information18 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 informationDesigning 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 informationT h e C S E T I P r o j e c t
T h e P r o j e c t T H E P R O J E C T T A B L E O F C O N T E N T S A r t i c l e P a g e C o m p r e h e n s i v e A s s es s m e n t o f t h e U F O / E T I P h e n o m e n o n M a y 1 9 9 1 1 E T
More informationGraph 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 informationDOCUMENT 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( ) ( ) ( ) 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 informationAppendix. In the absence of default risk, the benefit of the tax shield due to debt financing by the firm is 1 C E C
nx. Dvon o h n wh In h sn o ul sk h n o h x shl u o nnng y h m s s h ol ouon s h num o ssus s h oo nom x s h sonl nom x n s h v x on quy whh s wgh vg o vn n l gns x s. In hs s h o sonl nom xs on h x shl
More informationOutline. 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(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, 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 informationA ' / 1 6 " 5 ' / 4 " A4.2 48' - 0" 3 12' - 7" 13' - 11" 10' - 0" 9' - 0" 2' - 6" 1. 2: 12 INDICATES SHOW MELT TYP ABV ABV
4. 4. 4. K ' - / " ' - / 4 " 0 ' - / " ' - 0 " ' - 0 " ' - / " 4 ' - 0 " 4. M U PPR 48' - 0" ' - ' - " 0' - 0" ' - 0" ' - ". : WOM ' - 0 " OT: PROV URROU TR OUT SVS OR UTUR SP UTTY T OR QUSTR MPUS OTO
More informationH 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