Chapter 9. Graphs. 9.1 Graphs
|
|
- Alvin Harper
- 6 years ago
- Views:
Transcription
1 Chptr 9 Grphs Grphs r vry gnrl lss of ojt, us to formliz wi vrity of prtil prolms in omputr sin. In this hptr, w ll s th sis of (finit) unirt grphs, inluing grph isomorphism, onntivity, n grph oloring. 9.1 Grphs A grph onsists of st of nos V n st of gs E. W ll somtims rfr to th grph s pir of sts (V,E). Eh g in E joins two nos in V. Two nos onnt y n g r ll nighors or jnt. For xmpl, hr is grph in whih th nos r Illinois itis n th gs r ros joining thm: 100
2 CHAPTER 9. GRAPHS 101 Chigo Bloomington Urn Dnvill Springfil Dtur Agrphgntrvrsinothirtions, sinthisstrtxmpl, i.. th gs r unirt. Whn isussing rltions rlir, w us irt grphs, in whih h g h spifi irtion. Unlss w xpliitly stt othrwis, grph will lwys unirt. Conpts for unirt grphs xtn in strightforwr wys to irt grphs. Whn thr is only on g onnting two nos x n y, w n nm th g using th pir of nos. W oul ll th g xy or (sin orr osn t mttr) yx or {x, y}. So, in th grph ov, th Urn-Dnvill g onnts th no Urn n th no Dnvill. In som pplitions, w n grphs in whih two nos r onnt y multipl gs, i.. prlll gs with th sm npoints. For xmpl, th following grph shows wys to trvl mong four itis in th Sn Frniso By Ar. It hs thr gs from Sn Frniso to Okln, rprsnting iffrnt mos of trnsporttion. Whn multipl gs r prsnt, w typilly ll th gs rthr thn trying to nm gs y thir npoints. This igrm lso illustrts loop g whih onnts no to itslf.
3 CHAPTER 9. GRAPHS 102 tourist ruis Sn Frniso Rt 101 Plo Alto frry pln I-80 Rt 84 Okln I-880 Frmont A grph is ll simpl grph if it hs nithr multipl gs nor loop gs. Unlss w xpliitly stt othrwis, grph will lwys simpl grph. Also, w ll ssum tht it hs t lst on no n tht it hs only finit numr of gs n nos. Agin, most onpts xtn in rsonl wy to infinit n non-simpl grphs. 9.2 Dgrs Th gr ofnov, writtn g(v)is thnumr of gs whih hv v s n npoint. Slf-loops, if you r llowing thm, ount twi. For xmpl, in th following grph, hs gr 2, hs gr 6, hs gr 0, n so forth. f
4 CHAPTER 9. GRAPHS 103 Eh g ontriuts to two no grs. So th sum of th grs of ll th nos is twi th numr of gs. This is ll th Hnshking Thorm n n writtn s g(v) = 2 E v V This is slightly iffrnt vrsion of summtion nottion. W pik h no v in th st V, gt its gr, n its vlu into th sum. Sin V is finit, w oul lso hv givn nms to th nos v 1,...,v n n thn writtn n v k Vg(v) = 2 E k=1 Th vntg to th first, st-s, styl is tht it gnrlizs wll to situtions involving infinit sts. 9.3 Complt grphs Svrl spil typs of grphs r usful s xmpls. First, th omplt grph on n nos (shorthn nm K n ), is grph with n nos in whih vry no is onnt to vry othr no. K 5 is shown low. To lult th numr of gs in K n, think out th sitution from th prsptiv of th first no. It is onnt to n 1 othr nos. If w look t th son no, it s n 2 mor onntions. An so forth. So w hv n k=1 (n k) = n 1 k=0 k = n(n 1) gs. 2
5 CHAPTER 9. GRAPHS Cyl grphs n whls Suppos tht w hv n nos nm v 1,...,v n, whr n 3. Thn th yl grph C n is th grph with ths nos n gs onnting v i to v i+1, plus n itionl g from v n to v 1. Tht is, th st of gs is: So C 5 looks lik E = {v 1 v 2, v 2 v 3,..., v n 1 v n, v n v 1 } C n hs n nos n lso n gs. Cyl grphs oftn our in ntworking pplitions. Thy oul lso us to mol gms lik tlphon whr popl sit in irl n ommunit only with thir nighors. Th whl W n is just lik th yl grph C n xpt tht it hs n itionl ntrl hu no whih is onnt to ll th othrs. Noti tht W n hs n+1 nos (not n nos). It hs 2n gs. For xmpl, W 5 looks lik hu
6 CHAPTER 9. GRAPHS Isomorphism In grph thory, w only r out how nos n gs r onnt togthr. W on t r out how thy r rrng on th pg or in sp, how th nos n gs r nm, n whthr th gs r rwn s stright or urvy. W woul lik to trt grphs s intrhngl if thy hv th sm strt onntivity strutur. Spifilly, suppos tht G 1 = (V 1,E 1 ) n G 2 = (V 2,E 2 ) r grphs. An isomorphism from G 1 to G 2 is ijtion f : V 1 V 2 suh tht nos n r join y n g if n only if f() n f() r join y n g. Th grphs G 1 n G 2 r isomorphi if thr is n isomorphism from G 1 to G 2. For xmpl, th following two grphs r isomorphi. W n prov this y fining th funtion f so tht it mps 1 to, 2 to, 3 to, n 4 to. Th rr n thn vrify tht gs xist in th lft grph if n only if th orrsponing gs xist in th right grph Grph isomorphism is nothr xmpl of n quivln rltion. Eh quivln lss ontins group of grphs whih r suprfiilly iffrnt (.g. iffrnt nms for th nos, rwn iffrntly on th pg) ut ll rprsnt th sm unrlying strt grph. To prov tht two grphs r not isomorphi, w oul wlk through ll possil funtions mpping th nos of on to th nos of th othr. Howvr, tht s hug numr of funtions for grphs of ny intrsting siz. An xponntil numr, in ft. Inst, ttr thniqu for mny xmpls is to noti tht numr of grph proprtis r invrint, i.. prsrv y isomorphism. Th two grphs must hv th sm numr of nos n th sm numr of gs.
7 CHAPTER 9. GRAPHS 106 For ny no gr k, th two grphs must hv th sm numr of nos of gr k. For xmpl, thy must hv th sm numr of nos with gr 3. W n prov tht two grphs r not isomorphi y giving on xmpl of proprty tht is suppos to invrint ut, in ft, iffrs twn th two grphs. For xmpl, in th following pitur, th lfthn grph hs no of gr 3, ut th righthn grph hs no nos of gr 3, so thy n t isomorphi Sugrphs It s not hr to fin pir of grphs tht rn t isomorphi ut whr th most ovious proprtis (.g. no grs) mth. To prov tht suh pir isn t isomorphi, it s oftn hlpful to fous on rtin spifi lol fturs of on grph tht rn t prsnt in th othr grph. For xmpl, th following two grphs hv th sm no grs: on no of gr 1, thr of gr 2, on of gr 3. Howvr, littl xprimnttion suggsts thy rn t isomorphi To mk onvining rgumnt tht ths grphs rn t isomorphi, w n to fin th notion of sugrph. If G n G r grphs, thn G is sugrph of G if n only if th nos of G r sust of th nos of
8 CHAPTER 9. GRAPHS 107 G n th gs of G r sust of th gs of G. If two grphs G n F r isomorphi, thn ny sugrph of G must hv mthing sugrph somwhr in F. A grph hs hug numr of sugrphs. Howvr, w n usully fin vin of non-isomorphism y looking t smll sugrphs. For xmpl, in thgrphsov, thlfthngrphhsc 3 ssugrph, utthrighthn grph os not. So thy n t isomorphi. 9.7 Wlks, pths, n yls In grph G, wlk of lngth k from no to no is finit squn of nos = v 1,v 2,...,v n = n finit squn of gs 1, 2,..., n 1 in whih i onnts v i n v i+1, for ll i. Unr most irumstns, it isn t nssry to giv oth th squn of nos n th squn of gs: on of th two is usully suffiint. Th lngth of wlk is th numr of gs in it. Th shortst wlks onsist of just singl no n hv lngth zro. A wlk is los if its strting n ning nos r th sm. Othrwis it is opn. A pth is wlk in whih no no is us mor thn on. A yl is los wlk with t lst thr nos in whih no no is us mor thn on xpt tht th strting n ning nos r th sm. For xmpl, in th following grph, thr is lngth-3 wlk from to :,,. Anothr wlk of lngth 3 woul hv gs:,,. Ths two wlks r lso pths. Thr r lso longr wlks from to, whih rn t pths us thy r-us nos,.g. th wlk with no squn,,,,,.
9 CHAPTER 9. GRAPHS 108 In th following grph, on yl of lngth 4 hs gs:,,,. Othr losly-rlt yls go through th sm nos ut with iffrnt strting point or in th opposit irtion,.g.,,,. Unlik yls, los wlks n r-us nos,.g.,,,,, is los wlk ut not yl. f Th following grph is yli, i.. it osn t ontin ny yls. f Noti tht th yl grph C n ontins 2n iffrnt yls. For xmpl, ifthvrtisofc 4 rlllsshownlow, thnonylis,,,, nothr is,,,, n so forth.
10 CHAPTER 9. GRAPHS Conntivity A grph G is onnt if thr is wlk twn vry pir of nos in G. Our prvious xmpls of grphs wr onnt. Th following grph is not onnt, us thr is no wlk from (for xmpl), to g. g f h If w hv grph G tht might or might not onnt, w n ivi G into onnt omponnts. Eh onnt omponnt ontins mximl (i.. iggst possil) st of nos tht r ll onnt to on nothr, plus ll thir gs. So, th ov grph hs thr onnt omponnts: on ontining nos,,, n, son ontining nos, f, n g, n thir tht ontins only th no h. Somtims two prts of grph r onnt y only singl g, so tht th grph woul om isonnt if tht g wr rmov. This is ll ut g. For xmpl, in th following grph, th g is ut g. In som pplitions, ut gs r prolm. E.g. in ntworking, thy r pls whr th ntwork is vulnrl. In othr pplitions (.g. ompilrs), thy rprsnt opportunitis to ivi lrgr prolm into svrl simplr ons. g f
11 CHAPTER 9. GRAPHS Distns In grphs, istns r s on th lngths of pths onnting pirs of nos. Spifilly, th istn (,) twn two nos n is th lngth of th shortst pth from to. Th imtr of grph is th mximum istn twn ny pir of nos in th grph. For xmpl, th lfthn grph low hs imtr 4, us (f,) = 4 n no othr pir of nos is furthr prt. Th righthn grph hs imtr 2, us (1,5) = 2 n no othr pir of nos is furthr prt. f Eulr iruits An Eulr iruit of grph G is los wlk tht uss h g of th grph xtly on. For xmpl, on Eulr iruit of th following grph woul,, f, f,, f, f,. f An Eulr iruit is possil xtly whn th grph is onnt n h no hs vn gr. Eh no hs to hv vn gr us, in orr to omplt th iruit, you hv to lv h no tht you ntr. If th
12 CHAPTER 9. GRAPHS 111 no hs o gr, you will vntully ntr no ut hv no unus g to go out on. Fsintion with Eulr iruits ts k to th 18th ntury. At tht tim, th ity of Königrg, in Prussi, h st of rigs tht look roughly s follows: Folks in th town wonr whthr it ws possil to tk wlk in whih you ross h rig xtly on, oming k to th sm pl you strt. This is th kin of thing tht strts long ts lt t night in pus, or kps popl mus uring oring hurh srvis. Lonr Eulr ws th on who xplin lrly why this isn t possil. For our spifi xmpl, th orrsponing grph looks s follows. Sin ll of th nos hv o gr, thr s no possiility of n Eulr iruit Grph oloring A oloringof grph G ssigns olor to h no of G, with th rstrition tht two jnt nos nvr hv th sm olor. If G n olor with
13 CHAPTER 9. GRAPHS 112 k olors, w sy tht G is k-olorl. Th hromti numr of G, writtn χ(g), is th smllst numr of olors n to olor G. For xmpl, only thr olors r rquir for this grph: R G R G B But th omplt grph K n rquirs n olors, us h no is jnt to ll th othr nos. E.g. K 4 n olor s follows: R G B Y To stlish tht n is th hromti numr for grph G, w n to stlish two fts: χ(g) n: G n olor with n olors. χ(g) n: G nnot olor with lss thn n olors For smll finit grphs, th simplst wy to show tht χ(g) n is to show oloring of G tht uss n olors. Showing tht χ(g) n n somtims qully strightforwr. For xmpl, G my ontin opy of K n, whih n t olor with lss thn n olors. Howvr, somtims it my nssry to stp rfully through ll th possil wys to olor G with n 1 olors n show tht non of thm works out.
14 CHAPTER 9. GRAPHS 113 So trmining th hromti numr of grph n rltivly sy for grphs with hlpful strutur, ut quit iffiult for othr sorts of grphs. A fully gnrl lgorithm to fin hromti numr will tk tim roughly xponntil inthsizofthgrph, forthmostiffiult input grphs. 1 Suh slow running tim isn t prtil xpt for smll xmpls, so pplitions tn to fous on pproximt solutions Why shoul I r? Grph oloring is rquir for solving wi rng of prtil prolms. For xmpl, thr is oloring lgorithm m in most ompilrs. Bus th gnrl prolm n t solv ffiintly, th implmnt lgorithms us limittions or pproximtions of vrious sorts so tht thy n run in rsonl mount of tim. For xmpl, suppos tht w wnt to llot rost frqunis to lol rio sttions. In th orrsponing grph prolm, h sttion is no n th frqunis r th olors. Two sttions r onnt y n g if thy r gogrphilly too los togthr, so tht thy woul intrfr if thy us th sm frquny. This grph shoul not too to olor in prti, so long s w hv lrg nough supply of frqunis ompr to th numrs of sttions lustr nr on nothr. W n mol suoku puzzl y stting up on no for h squr. Th olors r th 9 numrs, n som r pr-ssign to rtin nos. Two nos r onnt if thir squrs r in th sm lok or row or olumn. Th puzzl is solvl if w n 9-olor this grph, rspting th pr-ssign olors. W n mol xm shuling s oloring prolm. Th xms for two ourss shoul not put t th sm tim if thr is stunt who is in othourss. So w n mol this s grph, in whih h ours is no n ourss r onnt y gs if thy shr stunts. Th qustion is thn whthr w n olor th grph with k olors, whr k is th numr of xm tims in our shul. In th xm shuling prolm, w tully xpt th nswr to 1 In CS thory jrgon, this prolm is HP-hr.
15 CHAPTER 9. GRAPHS 114 no, us liminting onflits woul rquir n xssiv numr of xm tims. So th rl prtil prolm is: how fw stunts o w hv to tk out of th pitur (i.. giv spil onflit xms to) in orr to l to solv th oloring prolm with rsonl vlu for k. W lso hv th option of splitting ours (i.. offring shul onflit xm) to simplify th grph. A prtiulrly importnt us of oloring in omputr sin is rgistr llotion. A lrg jv or C progrm ontins mny nm vrils. But omputr hs smllish numr (.g. 32) of fst rgistrs whih n f si oprtions suh s ition. So vrils must llot to spifi rgistrs. Th nos in this oloring prolm r vrils. Th olors r rgistrs. Two vrils r onnt y n g if thy r in us t th sm tim n, thrfor, nnot shr rgistr. As with th xm shuling prolm, w tully xpt th rw oloring prolm to fil. Th ompilr thn uss so-ll spill oprtions to rk up th pnnis n rt grph w n olor with our limit numr of rgistrs. Th gol is to us s fw spills s possil Biprtit grphs Anothr spil typ of grph is iprtit grph. A grph G = (V,E) is iprtit if w n split V into two non-ovrlpping susts V 1 n V 2 suh tht vry g in G onnts n lmnt of V 1 with n lmnt of V 2. Tht is, no g onnts two nos from th sm prt of th ivision. Or, ltrntivly, grph is iprtit if n only if it is 2-olorl. For xmpl, th u grph is iprtit us w n olor it with two olors:
16 CHAPTER 9. GRAPHS 115 G R R G G R R G Biprtit grphs oftn ppr in mthing prolms, whr th two susts rprsnt iffrnt typs of ojts. For xmpl, on group of nos might stunts, th othr group of nos might workstuy jos, n th gs might init whih jos h stunt is intrst in. Th omplt iprtit grph K m,n is iprtit grph with m nos in V 1, n nos in V 2, n whih ontins ll possil gs tht r onsistnt with th finition of iprtit. Th igrm low shows prtil iprtit grph on st of 7 nos, s wll s th omplt iprtit grph K 3,2. Th omplt iprtit grph K m,n hs m+n nos n mn gs Vrition in trminology Although th or is of grph thory r quit stl, trminology vris lot n thr is hug rng of spiliz trminology for spifi typs of grphs. In prtiulr, nos r oftn ll vrtis Noti tht th singulr of this trm is vrtx (not vrti ). A omplt grph on som
17 CHAPTER 9. GRAPHS 116 st of vrtis is lso known s liqu. Wht w r lling wlk us to wily ll pth. Authors who still us this onvntion woul thn us th trm simpl pth to xlu rptition of vrtis. Trms for losly-rlt onpts,.g. yl, oftn hng s wll.
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 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 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 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 informationGraph Isomorphism. Graphs - II. Cayley s Formula. Planar Graphs. Outline. Is K 5 planar? The number of labeled trees on n nodes is n n-2
Grt Thortil Is In Computr Sin Vitor Amhik CS 15-251 Ltur 9 Grphs - II Crngi Mllon Univrsity Grph Isomorphism finition. Two simpl grphs G n H r isomorphi G H if thr is vrtx ijtion V H ->V G tht prsrvs jny
More 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 informationCSE 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 informationModule graph.py. 1 Introduction. 2 Graph basics. 3 Module graph.py. 3.1 Objects. CS 231 Naomi Nishimura
Moul grph.py CS 231 Nomi Nishimur 1 Introution Just lik th Python list n th Python itionry provi wys of storing, ssing, n moifying t, grph n viw s wy of storing, ssing, n moifying t. Bus Python os not
More informationCS200: Graphs. Graphs. Directed Graphs. Graphs/Networks Around Us. What can this represent? Sometimes we want to represent directionality:
CS2: Grphs Prihr Ch. 4 Rosn Ch. Grphs A olltion of nos n gs Wht n this rprsnt? n A omputr ntwork n Astrtion of mp n Soil ntwork CS2 - Hsh Tls 2 Dirt Grphs Grphs/Ntworks Aroun Us A olltion of nos n irt
More informationSection 10.4 Connectivity (up to paths and isomorphism, not including)
Toy w will isuss two stions: Stion 10.3 Rprsnting Grphs n Grph Isomorphism Stion 10.4 Conntivity (up to pths n isomorphism, not inluing) 1 10.3 Rprsnting Grphs n Grph Isomorphism Whn w r working on n lgorithm
More 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 informationThe University of Sydney MATH2969/2069. Graph Theory Tutorial 5 (Week 12) Solutions 2008
Th Univrsity o Syny MATH2969/2069 Grph Thory Tutoril 5 (Wk 12) Solutions 2008 1. (i) Lt G th isonnt plnr grph shown. Drw its ul G, n th ul o th ul (G ). (ii) Show tht i G is isonnt plnr grph, thn G is
More informationCSC Design and Analysis of Algorithms. Example: Change-Making Problem
CSC 801- Dsign n Anlysis of Algorithms Ltur 11 Gry Thniqu Exmpl: Chng-Mking Prolm Givn unlimit mounts of oins of nomintions 1 > > m, giv hng for mount n with th lst numr of oins Exmpl: 1 = 25, 2 =10, =
More informationb. How many ternary words of length 23 with eight 0 s, nine 1 s and six 2 s?
MATH 3012 Finl Exm, My 4, 2006, WTT Stunt Nm n ID Numr 1. All our prts o this prolm r onrn with trnry strings o lngth n, i.., wors o lngth n with lttrs rom th lpht {0, 1, 2}.. How mny trnry wors o lngth
More 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 informationSolutions for HW11. Exercise 34. (a) Use the recurrence relation t(g) = t(g e) + t(g/e) to count the number of spanning trees of v 1
Solutions for HW Exris. () Us th rurrn rltion t(g) = t(g ) + t(g/) to ount th numr of spnning trs of v v v u u u Rmmr to kp multipl gs!! First rrw G so tht non of th gs ross: v u v Rursing on = (v, u ):
More informationGarnir Polynomial and their Properties
Univrsity of Cliforni, Dvis Dprtmnt of Mthmtis Grnir Polynomil n thir Proprtis Author: Yu Wng Suprvisor: Prof. Gorsky Eugny My 8, 07 Grnir Polynomil n thir Proprtis Yu Wng mil: uywng@uvis.u. In this ppr,
More informationCS61B Lecture #33. Administrivia: Autograder will run this evening. Today s Readings: Graph Structures: DSIJ, Chapter 12
Aministrivi: CS61B Ltur #33 Autogrr will run this vning. Toy s Rings: Grph Struturs: DSIJ, Chptr 12 Lst moifi: W Nov 8 00:39:28 2017 CS61B: Ltur #33 1 Why Grphs? For xprssing non-hirrhilly rlt itms Exmpls:
More 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 information0.1. Exercise 1: the distances between four points in a graph
Mth 707 Spring 2017 (Drij Grinrg): mitrm 3 pg 1 Mth 707 Spring 2017 (Drij Grinrg): mitrm 3 u: W, 3 My 2017, in lss or y mil (grinr@umn.u) or lss S th wsit or rlvnt mtril. Rsults provn in th nots, or in
More informationV={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}
s s of s Computr Sin & Enginring 423/823 Dsign n Anlysis of Ltur 03 (Chptr 22) Stphn Sott (Apt from Vinohnrn N. Vriym) s of s s r strt t typs tht r pplil to numrous prolms Cn ptur ntitis, rltionships twn
More informationV={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}
Introution Computr Sin & Enginring 423/823 Dsign n Anlysis of Algorithms Ltur 03 Elmntry Grph Algorithms (Chptr 22) Stphn Sott (Apt from Vinohnrn N. Vriym) I Grphs r strt t typs tht r pplil to numrous
More informationExam 1 Solution. CS 542 Advanced Data Structures and Algorithms 2/14/2013
CS Avn Dt Struturs n Algorithms Exm Solution Jon Turnr //. ( points) Suppos you r givn grph G=(V,E) with g wights w() n minimum spnning tr T o G. Now, suppos nw g {u,v} is to G. Dsri (in wors) mtho or
More informationAlgorithmic and NP-Completeness Aspects of a Total Lict Domination Number of a Graph
Intrntionl J.Mth. Comin. Vol.1(2014), 80-86 Algorithmi n NP-Compltnss Aspts of Totl Lit Domintion Numr of Grph Girish.V.R. (PES Institut of Thnology(South Cmpus), Bnglor, Krntk Stt, Ini) P.Ush (Dprtmnt
More informationAn undirected graph G = (V, E) V a set of vertices E a set of unordered edges (v,w) where v, w in V
Unirt Grphs An unirt grph G = (V, E) V st o vrtis E st o unorr gs (v,w) whr v, w in V USE: to mol symmtri rltionships twn ntitis vrtis v n w r jnt i thr is n g (v,w) [or (w,v)] th g (v,w) is inint upon
More information1. Determine whether or not the following binary relations are equivalence relations. Be sure to justify your answers.
Mth 0 Exm - Prti Prolm Solutions. Dtrmin whthr or not th ollowing inry rltions r quivln rltions. B sur to justiy your nswrs. () {(0,0),(0,),(0,),(,),(,),(,),(,),(,0),(,),(,),(,0),(,),(.)} on th st A =
More informationCSE 373. Graphs 1: Concepts, Depth/Breadth-First Search reading: Weiss Ch. 9. slides created by Marty Stepp
CSE 373 Grphs 1: Conpts, Dpth/Brth-First Srh ring: Wiss Ch. 9 slis rt y Mrty Stpp http://www.s.wshington.u/373/ Univrsity o Wshington, ll rights rsrv. 1 Wht is grph? 56 Tokyo Sttl Soul 128 16 30 181 140
More informationCS 461, Lecture 17. Today s Outline. Example Run
Prim s Algorithm CS 461, Ltur 17 Jr Si Univrsity o Nw Mxio In Prim s lgorithm, th st A mintin y th lgorithm orms singl tr. Th tr strts rom n ritrry root vrtx n grows until it spns ll th vrtis in V At h
More information, 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 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 informationWhy the Junction Tree Algorithm? The Junction Tree Algorithm. Clique Potential Representation. Overview. Chris Williams 1.
Why th Juntion Tr lgorithm? Th Juntion Tr lgorithm hris Willims 1 Shool of Informtis, Univrsity of Einurgh Otor 2009 Th JT is gnrl-purpos lgorithm for omputing (onitionl) mrginls on grphs. It os this y
More informationThis chapter covers special properties of planar graphs.
Chptr 21 Plnr Grphs This hptr ovrs spil proprtis of plnr grphs. 21.1 Plnr grphs A plnr grph is grph whih n b rwn in th pln without ny gs rossing. Som piturs of plnr grph might hv rossing gs, but it s possibl
More informationRegister Allocation. Register Allocation. Principle Phases. Principle Phases. Example: Build. Spills 11/14/2012
Rgistr Allotion W now r l to o rgistr llotion on our intrfrn grph. W wnt to l with two typs of onstrints: 1. Two vlus r liv t ovrlpping points (intrfrn grph) 2. A vlu must or must not in prtiulr rhitturl
More information12. Traffic engineering
lt2.ppt S-38. Introution to Tltrffi Thory Spring 200 2 Topology Pths A tlommunition ntwork onsists of nos n links Lt N not th st of nos in with n Lt J not th st of nos in with j N = {,,,,} J = {,2,3,,2}
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 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 informationPresent state Next state Q + M N
Qustion 1. An M-N lip-lop works s ollows: I MN=00, th nxt stt o th lip lop is 0. I MN=01, th nxt stt o th lip-lop is th sm s th prsnt stt I MN=10, th nxt stt o th lip-lop is th omplmnt o th prsnt stt I
More informationAnnouncements. Not graphs. These are Graphs. Applications of Graphs. Graph Definitions. Graphs & Graph Algorithms. A6 released today: Risk
Grphs & Grph Algorithms Ltur CS Spring 6 Announmnts A6 rls toy: Risk Strt signing with your prtnr sp Prlim usy Not grphs hs r Grphs K 5 K, =...not th kin w mn, nywy Applitions o Grphs Communition ntworks
More 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 informationCSE 373: AVL trees. Warmup: Warmup. Interlude: Exploring the balance invariant. AVL Trees: Invariants. AVL tree invariants review
rmup CSE 7: AVL trs rmup: ht is n invrint? Mihl L Friy, Jn 9, 0 ht r th AVL tr invrints, xtly? Disuss with your nighor. AVL Trs: Invrints Intrlu: Exploring th ln invrint Cor i: xtr invrint to BSTs tht
More informationCOMPLEXITY OF COUNTING PLANAR TILINGS BY TWO BARS
OMPLXITY O OUNTING PLNR TILINGS Y TWO RS KYL MYR strt. W show tht th prolm o trmining th numr o wys o tiling plnr igur with horizontl n vrtil r is #P-omplt. W uil o o th rsults o uquir, Nivt, Rmil, n Roson
More informationMore Foundations. Undirected Graphs. Degree. A Theorem. Graphs, Products, & Relations
Mr Funtins Grphs, Pruts, & Rltins Unirt Grphs An unirt grph is pir f 1. A st f ns 2. A st f gs (whr n g is st f tw ns*) Friy, Sptmr 2, 2011 Ring: Sipsr 0.2 ginning f 0.4; Stughtn 1.1.5 ({,,,,}, {{,}, {,},
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 information# 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 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 informationCS 241 Analysis of Algorithms
CS 241 Anlysis o Algorithms Prossor Eri Aron Ltur T Th 9:00m Ltur Mting Lotion: OLB 205 Businss HW6 u lry HW7 out tr Thnksgiving Ring: Ch. 22.1-22.3 1 Grphs (S S. B.4) Grphs ommonly rprsnt onntions mong
More information5/7/13. Part 10. Graphs. Theorem Theorem Graphs Describing Precedence. Outline. Theorem 10-1: The Handshaking Theorem
Thorm 10-1: Th Hnshkin Thorm Lt G=(V,E) n unirt rph. Thn Prt 10. Grphs CS 200 Alorithms n Dt Struturs v V (v) = 2 E How mny s r thr in rph with 10 vrtis h of r six? 10 * 6 /2= 30 1 Thorm 10-2 An unirt
More informationCOMP108 Algorithmic Foundations
Grdy mthods Prudn Wong http://www.s.liv..uk/~pwong/thing/omp108/01617 Coin Chng Prolm Suppos w hv 3 typs of oins 10p 0p 50p Minimum numr of oins to mk 0.8, 1.0, 1.? Grdy mthod Lrning outoms Undrstnd wht
More informationOutline. 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 informationSimilarity Search. The Binary Branch Distance. Nikolaus Augsten.
Similrity Srh Th Binry Brnh Distn Nikolus Augstn nikolus.ugstn@sg..t Dpt. of Computr Sins Univrsity of Slzurg http://rsrh.uni-slzurg.t Vrsion Jnury 11, 2017 Wintrsmstr 2016/2017 Augstn (Univ. Slzurg) Similrity
More informationQUESTIONS 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 informationWeighted graphs -- reminder. Data Structures LECTURE 15. Shortest paths algorithms. Example: weighted graph. Two basic properties of shortest paths
Dt Strutur LECTURE Shortt pth lgorithm Proprti of hortt pth Bllmn-For lgorithm Dijktr lgorithm Chptr in th txtook (pp ). Wight grph -- rminr A wight grph i grph in whih g hv wight (ot) w(v i, v j ) >.
More informationNumbering Boundary Nodes
Numring Bounry Nos Lh MBri Empori Stt Univrsity August 10, 2001 1 Introution Th purpos of this ppr is to xplor how numring ltril rsistor ntworks ffts thir rspons mtrix, Λ. Morovr, wht n lrn from Λ out
More informationTrees as operads. Lecture A formalism of trees
Ltur 2 rs s oprs In this ltur, w introu onvnint tgoris o trs tht will us or th inition o nroil sts. hs tgoris r gnrliztions o th simpliil tgory us to in simpliil sts. First w onsir th s o plnr trs n thn
More informationSeven-Segment Display Driver
7-Smnt Disply Drivr, Ron s in 7-Smnt Disply Drivr, Ron s in Prolm 62. 00 0 0 00 0000 000 00 000 0 000 00 0 00 00 0 0 0 000 00 0 00 BCD Diits in inry Dsin Drivr Loi 4 inputs, 7 outputs 7 mps, h with 6 on
More informationS i m p l i f y i n g A l g e b r a SIMPLIFYING ALGEBRA.
S i m p l i y i n g A l g r SIMPLIFYING ALGEBRA www.mthltis.o.nz Simpliying SIMPLIFYING Algr ALGEBRA Algr is mthmtis with mor thn just numrs. Numrs hv ix vlu, ut lgr introus vrils whos vlus n hng. Ths
More informationDUET WITH DIAMONDS COLOR SHIFTING BRACELET By Leslie Rogalski
Dut with Dimons Brlt DUET WITH DIAMONDS COLOR SHIFTING BRACELET By Lsli Roglski Photo y Anrw Wirth Supruo DUETS TM from BSmith rt olor shifting fft tht mks your work tk on lif of its own s you mov! This
More informationRegister Allocation. How to assign variables to finitely many registers? What to do when it can t be done? How to do so efficiently?
Rgistr Allotion Rgistr Allotion How to ssign vrils to initly mny rgistrs? Wht to o whn it n t on? How to o so iintly? Mony, Jun 3, 13 Mmory Wll Disprity twn CPU sp n mmory ss sp improvmnt Mony, Jun 3,
More informationGraph Theory. Vertices. Vertices are also known as nodes, points and (in social networks) as actors, agents or players.
Stphn P. Borgtti Grph Thory A lthough grph thory is on o th youngr rnhs o mthmtis, it is unmntl to numr o ppli ils, inluing oprtions rsrh, omputr sin, n soil ntwork nlysis. In this hptr w isuss th si onpts
More informationQUESTIONS BEGIN HERE!
Points miss: Stunt's Nm: Totl sor: /100 points Est Tnnss Stt Univrsity Dprtmnt o Computr n Inormtion Sins CSCI 2710 (Trno) Disrt Struturs TEST or Sprin Smstr, 2005 R this or strtin! This tst is los ook
More informationComplete Solutions for MATH 3012 Quiz 2, October 25, 2011, WTT
Complt Solutions or MATH 012 Quiz 2, Otor 25, 2011, WTT Not. T nswrs ivn r r mor omplt tn is xpt on n tul xm. It is intn tt t mor omprnsiv solutions prsnt r will vlul to stunts in stuyin or t inl xm. In
More informationPage 1. Question 19.1b Electric Charge II Question 19.2a Conductors I. ConcepTest Clicker Questions Chapter 19. Physics, 4 th Edition James S.
ConTst Clikr ustions Chtr 19 Physis, 4 th Eition Jms S. Wlkr ustion 19.1 Two hrg blls r rlling h othr s thy hng from th iling. Wht n you sy bout thir hrgs? Eltri Chrg I on is ositiv, th othr is ngtiv both
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 informationA Simple Code Generator. Code generation Algorithm. Register and Address Descriptors. Example 3/31/2008. Code Generation
A Simpl Co Gnrtor Co Gnrtion Chptr 8 II Gnrt o for singl si lok How to us rgistrs? In most mhin rhitturs, som or ll of th oprnsmust in rgistrs Rgistrs mk goo tmporris Hol vlus tht r omput in on si lok
More informationUsing the Printable Sticker Function. Using the Edit Screen. Computer. Tablet. ScanNCutCanvas
SnNCutCnvs Using th Printl Stikr Funtion On-o--kin stikrs n sily rt y using your inkjt printr n th Dirt Cut untion o th SnNCut mhin. For inormtion on si oprtions o th SnNCutCnvs, rr to th Hlp. To viw th
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 informationa b c cat CAT A B C Aa Bb Cc cat cat Lesson 1 (Part 1) Verbal lesson: Capital Letters Make The Same Sound Lesson 1 (Part 1) continued...
Progrssiv Printing T.M. CPITLS g 4½+ Th sy, fun (n FR!) wy to tch cpitl lttrs. ook : C o - For Kinrgrtn or First Gr (not for pr-school). - Tchs tht cpitl lttrs mk th sm souns s th littl lttrs. - Tchs th
More informationSOLVED EXAMPLES. be the foci of an ellipse with eccentricity e. For any point P on the ellipse, prove that. tan
LOCUS 58 SOLVED EXAMPLES Empl Lt F n F th foci of n llips with ccntricit. For n point P on th llips, prov tht tn PF F tn PF F Assum th llips to, n lt P th point (, sin ). P(, sin ) F F F = (-, 0) F = (,
More informationCS 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 informationSection 3: Antiderivatives of Formulas
Chptr Th Intgrl Appli Clculus 96 Sction : Antirivtivs of Formuls Now w cn put th is of rs n ntirivtivs togthr to gt wy of vluting finit intgrls tht is ct n oftn sy. To vlut finit intgrl f(t) t, w cn fin
More informationThe Plan. Honey, I Shrunk the Data. Why Compress. Data Compression Concepts. Braille Example. Braille. x y xˆ
h ln ony, hrunk th t ihr nr omputr in n nginring nivrsity of shington t omprssion onpts ossy t omprssion osslss t omprssion rfix os uffmn os th y 24 2 t omprssion onpts originl omprss o x y xˆ nor or omprss
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 informationEE1000 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 informationAnnouncements. These are Graphs. This is not a Graph. Graph Definitions. Applications of Graphs. Graphs & Graph Algorithms
Grphs & Grph Algorithms Ltur CS Fll 5 Announmnts Upoming tlk h Mny Crrs o Computr Sintist Or how Computr Sin gr mpowrs you to o muh mor thn o Dn Huttnlohr, Prossor in th Dprtmnt o Computr Sin n Johnson
More informationGraph Contraction and Connectivity
Chptr 17 Grph Contrtion n Conntivity So r w hv mostly ovr thniqus or solving prolms on grphs tht wr vlop in th ontxt o squntil lgorithms. Som o thm r sy to prllliz whil othrs r not. For xmpl, w sw tht
More informationNefertiti. Echoes of. Regal components evoke visions of the past MULTIPLE STITCHES. designed by Helena Tang-Lim
MULTIPLE STITCHES Nrtiti Ehos o Rgl omponnts vok visions o th pst sign y Hln Tng-Lim Us vrity o stiths to rt this rgl yt wrl sign. Prt sping llows squr s to mk roun omponnts tht rp utiully. FCT-SC-030617-07
More informationChapter 18. Minimum Spanning Trees Minimum Spanning Trees. a d. a d. a d. f c
Chptr 8 Minimum Spnning Trs In this hptr w ovr importnt grph prolm, Minimum Spnning Trs (MST). Th MST o n unirt, wight grph is tr tht spns th grph whil minimizing th totl wight o th gs in th tr. W irst
More informationProblem solving by search
Prolm solving y srh Tomáš voo Dprtmnt o Cyrntis, Vision or Roots n Autonomous ystms Mrh 5, 208 / 3 Outlin rh prolm. tt sp grphs. rh trs. trtgis, whih tr rnhs to hoos? trtgy/algorithm proprtis? Progrmming
More informationSolutions to Homework 5
Solutions to Homwork 5 Pro. Silvia Frnánz Disrt Mathmatis Math 53A, Fall 2008. [3.4 #] (a) Thr ar x olor hois or vrtx an x or ah o th othr thr vrtis. So th hromati polynomial is P (G, x) =x (x ) 3. ()
More informationCSE303 - Introduction to the Theory of Computing Sample Solutions for Exercises on Finite Automata
CSE303 - Introduction to th Thory of Computing Smpl Solutions for Exrciss on Finit Automt Exrcis 2.1.1 A dtrministic finit utomton M ccpts th mpty string (i.., L(M)) if nd only if its initil stt is finl
More informationLast time: introduced our first computational model the DFA.
Lctur 7 Homwork #7: 2.2.1, 2.2.2, 2.2.3 (hnd in c nd d), Misc: Givn: M, NFA Prov: (q,xy) * (p,y) iff (q,x) * (p,) (follow proof don in clss tody) Lst tim: introducd our first computtionl modl th DFA. Tody
More informationNP-Completeness. CS3230 (Algorithm) Traveling Salesperson Problem. What s the Big Deal? Given a Problem. What s the Big Deal? What s the Big Deal?
NP-Compltnss 1. Polynomil tim lgorithm 2. Polynomil tim rution 3.P vs NP 4.NP-ompltnss (som slis y P.T. Um Univrsity o Txs t Dlls r us) Trvling Slsprson Prolm Fin minimum lngth tour tht visits h ity on
More informationComputational Biology, Phylogenetic Trees. Consensus methods
Computtionl Biology, Phylognti Trs Consnsus mthos Asgr Bruun & Bo Simonsn Th 16th of Jnury 2008 Dprtmnt of Computr Sin Th univrsity of Copnhgn 0 Motivtion Givn olltion of Trs Τ = { T 0,..., T n } W wnt
More informationIn order to learn which questions have been answered correctly: 1. Print these pages. 2. Answer the questions.
Crystl Rports for Visul Stuio.NET In orr to lrn whih qustions hv n nswr orrtly: 1. Print ths pgs. 2. Answr th qustions. 3. Sn this ssssmnt with th nswrs vi:. FAX to (212) 967-3498. Or. Mil th nswrs to
More informationCS553 Lecture Register Allocation 1
Low-Lvl Issus Lst ltur Livnss nlysis Rgistr llotion Toy Mor rgistr llotion Wnsy Common suxprssion limintion or PA2 Logistis PA1 is u PA2 hs n post Mony th 15 th, no lss u to LCPC in Orgon CS553 Ltur Rgistr
More informationWalk Like a Mathematician Learning Task:
Gori Dprtmnt of Euction Wlk Lik Mthmticin Lrnin Tsk: Mtrics llow us to prform mny usful mthmticl tsks which orinrily rquir lr numbr of computtions. Som typs of problms which cn b on fficintly with mtrics
More informationUNCORRECTED SAMPLE PAGES 4-1. Naming fractions KEY IDEAS. 1 Each shape represents ONE whole. a i ii. b i ii
- Nming frtions Chptr Frtions Eh shp rprsnts ONE whol. i ii Wht frtion is shdd? Writ s frtion nd in words. Wht frtion is not shdd? Writ s frtion nd in words. i ii i ii Writ s mny diffrnt frtions s you
More informationN=4 L=4. Our first non-linear data structure! A graph G consists of two sets G = {V, E} A set of V vertices, or nodes f
lulu jwtt pnlton sin towr ounrs hpl lpp lu Our irst non-linr t strutur! rph G onsists o two sts G = {V, E} st o V vrtis, or nos st o E s, rltionships twn nos surph G onsists o sust o th vrtis n s o G jnt
More informationAnalysis for Balloon Modeling Structure based on Graph Theory
Anlysis for lloon Moling Strutur bs on Grph Thory Abstrt Mshiro Ur* Msshi Ym** Mmoru no** Shiny Miyzki** Tkmi Ysu* *Grut Shool of Informtion Sin, Ngoy Univrsity **Shool of Informtion Sin n Thnology, hukyo
More informationarxiv: v1 [cs.ds] 20 Feb 2008
Symposium on Thortil Aspts of Computr Sin 2008 (Borux), pp. 361-372 www.sts-onf.org rxiv:0802.2867v1 [s.ds] 20 F 2008 FIXED PARAMETER POLYNOMIAL TIME ALGORITHMS FOR MAXIMUM AGREEMENT AND COMPATIBLE SUPERTREES
More informationThe 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 informationPolygons POLYGONS.
Polgons PLYGNS www.mthltis.o.uk ow os it work? Solutions Polgons Pg qustions Polgons Polgon Not polgon Polgon Not polgon Polgon Not polgon Polgon Not polgon f g h Polgon Not polgon Polgon Not polgon Polgon
More informationMotivation. Problems. Puzzle 1
Introution to Roust Algorithms Séstin Tixuil UPMC & IUF Motition Approh Fults n ttks our in th ntwork Th ntwork s usr must not noti somthing wrong hppn A smll numr of fulty omponnts Msking pproh to fult/ttk
More informationINTEGRALS. Chapter 7. d dx. 7.1 Overview Let d dx F (x) = f (x). Then, we write f ( x)
Chptr 7 INTEGRALS 7. Ovrviw 7.. Lt d d F () f (). Thn, w writ f ( ) d F () + C. Ths intgrls r clld indfinit intgrls or gnrl intgrls, C is clld constnt of intgrtion. All ths intgrls diffr y constnt. 7..
More informationOn Local Transformations in Plane Geometric Graphs Embedded on Small Grids
On Lol Trnsformtions in Pln Gomtri Grphs Em on Smll Gris Mnul Allns Prosnjit Bos Alfro Grí Frrn Hurto Pro Rmos Euro Rivr-Cmpo Jvir Tjl Astrt Givn two n-vrtx pln grphs G 1 = (V 1, E 1 ) n G 2 = (V 2, E
More informationMultipoint Alternate Marking method for passive and hybrid performance monitoring
Multipoint Altrnt Mrkin mtho or pssiv n hyri prormn monitorin rt-iool-ippm-multipoint-lt-mrk-00 Pru, Jul 2017, IETF 99 Giuspp Fiool (Tlom Itli) Muro Coilio (Tlom Itli) Amo Spio (Politnio i Torino) Riro
More informationDecimals DECIMALS.
Dimls DECIMALS www.mthltis.o.uk ow os it work? Solutions Dimls P qustions Pl vlu o imls 0 000 00 000 0 000 00 0 000 00 0 000 00 0 000 tnths or 0 thousnths or 000 hunrths or 00 hunrths or 00 0 tn thousnths
More informationIntegration Continued. Integration by Parts Solving Definite Integrals: Area Under a Curve Improper Integrals
Intgrtion Continud Intgrtion y Prts Solving Dinit Intgrls: Ar Undr Curv Impropr Intgrls Intgrtion y Prts Prticulrly usul whn you r trying to tk th intgrl o som unction tht is th product o n lgric prssion
More informationCounting Paths Between Vertices. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs
Isomorphism of Grphs Definition The simple grphs G 1 = (V 1, E 1 ) n G = (V, E ) re isomorphi if there is ijetion (n oneto-one n onto funtion) f from V 1 to V with the property tht n re jent in G 1 if
More informationA 43k Kernel for Planar Dominating Set using Computer-Aided Reduction Rule Discovery
A 43k Krnl for Plnr Dominting St using Computr-Ai Rution Rul Disovry John Torås Hlsth Dprtmnt of Informtis Univrsity of Brgn A thsis sumitt for th gr of Mstr of Sin Suprvisor: Dnil Lokshtnov Frury 2016
More information