Sybil Attacks and Defenses
|
|
|
- Elizabeth Shields
- 5 years ago
- Views:
Transcription
1 CPSC 426/526 Syil Attks n Dfnss Ennn Zhi Computr Sin Dprtmnt Yl Univrsity
2 Rll: L-5 Rputtion systms: - Why w n rputtion/trust systms - Wht is glol rputtion mol - Wht is prsonliz rputtion mol - Cs stuis: PgRnk n Crn
3 Ltur Romp Syil Attks Syil Dfnss Cs Stuy: DSyil Cs Stuy: SyilGur
4 Tom n Jrry Gms
5 Tom n Jrry Gms P2P ontnt-shring systms
6 Tom n Jrry Gms Pollution ttks P2P ontnt-shring systms
7 Tom n Jrry Gms Pollution ttks P2P ontnt-shring systms Rputtion systms
8 Tom n Jrry Gms Pollution ttks P2P ontnt-shring systms Rputtion systms Syil ttks
9 Tom n Jrry Gms Pollution ttks P2P ontnt-shring systms Rputtion systms Syil ttks Syil fnss
10 Wht is syil ttk? Syil ttk: - Singl vrsry prtns mny fk/syil intitis - Crt hug numr of ounts or intitis - Syil intitis lunh ttks in ritrry wys - Outvoting honst usrs in ny ollortiv systm
11 Syil
12 Lt s ttk Crn Crn ssums: - thr is no lrg-sl syil ttk - most of mliious usrs o not ollu - vrsry nnot ontrol th mjority of nos to lunh ttks in smrt wy - Crn tris to hnl syil ttkrs y ig fils, ut this os not work wll Crn is vulnrl to syil ttks
13 Lt s ttk Crn C: -1 D: +1 Fil1 A: +1 B: +1 C: -1 Fil2 A: -1 B: -1 Fil3 A: -1 C: +1 D: -1 Fil4 A D: -1 Fil5 A: +1 D: -1 Fil6 C: +1 G: -1 Fil7
14 Lt s ttk Crn C: -1 A: +1 A: -1 A: -1 D: +1 B: +1 B: -1 C: +1 C: -1 D: -1 Fil3 Assum Fil1 5 is pollut n B is syil intity Fil2 Fil4 A D: -1 Fil5 A: +1 D: -1 Fil6 C: +1 G: -1 Fil7
15 Lt s ttk Crn C: -1 D: +1 Fil1 A: +1 B: +1 C: -1 Fil2 A: -1 B: -1 Fil3 A: -1 C: +1 D: -1 Fil4 A D: -1 Fil5 A: +1 D: -1 Fil6 C: +1 G: -1 Fil7
16 Lt s ttk Crn C: -1 D: +1 Fil1 A: +1 B: +1 C: -1 Fil2 A: -1 B: -1 Fil3 A: -1 C: +1 D: -1 Fil4 A D: -1 Fil5 A: +1 D: -1 Fil6 C: +1 G: -1 Fil7
17 Lt s ttk Crn C: -1 D: +1 Fil1 A: +1 B: +1 C: -1 Fil2 A: -1 B: -1 Fil3 A: -1 C: +1 D: -1 Fil4 A B: +1 D: -1 Fil5 A: +1 D: -1 Fil6 C: +1 G: -1 Fil7
18 # of syil ttkrs utomt syil ttk for $147 # of syil intitis >> # of norml usrs Syil ttkrs n ollu n lunh ritrry ttks
19 Snrios of Syil Attks Syil ttks xist in ny puli systms/srvis: - Thr is no stringnt rgultory uthority - Attkrs n hv muh mor rsours thn norml usrs - Attkrs n ontrol iffrnt intitis to lunh ttks in ritrry wys,.g., ollusion
20 Snrios of Syil Attks Snrios r vulnrl to syil ttks: - Rommntion/Rputtion systms,.g., Digg - Gming systms - Soil ntwork systms,.g., Twittr n Fook - Any ollortiv systms
21 Snrios of Syil Attks Snrios r vulnrl to syil ttks: - Rommntion/Rputtion systms,.g., Digg - Gming systms - Soil ntwork systms,.g., Twittr n Fook - Any ollortiv systms Wht snrios o not hv syil intitis: - This is hr to sy... - It is hr to rt mssiv syil intitis in nk systms - In som snrios, it is not mningful to lunh syil ttks
22 Ltur Romp Syil Attks Syil Dfnss Cs Stuy: DSyil Cs Stuy: SyilGur
23 Dfning ginst syil is hllnging Impossil to fn in ntrliz systms unlss spil ssumptions This hs n formlly prov y Douur [IPTPS 02]
24 Dfning ginst syil is hllnging Dfning ginst syil ttks in ntrliz systms: - Using trust ntrl uthority - Tying intitis to tul humn ings,.g., soil surity numr Not lwys sirl: - Tying intitis to uthority is iffiult in most systms - Snsitiv informtion my sr wy norml usrs - Authority might ottlnk n trgt of ttks
25 Thnil Solutions Som fnss r propos ginst syil ttks: - Syil ttion: intifying if no is syil intity - Syil tolrn: mking my systm funtions orrtly without intifying syil intitis
26 Syil tolrn: Thnil Solutions - srviing orrtly without tting syil intitis - lvrging soil ntworks or historil tivitis to upgr th proility of ommuniting with goo usrs - s stuy: DSyil [S&P 09] Syil ttion: - intifying if no is syil intity - lvrging soil ntworks or som osrv hvior pttrns,.g., timing, to tt syil intitis - s stuy: SyilGur [SIGCOMM 06]
27 Ltur Romp Syil Attks Syil Dfnss Cs Stuy: DSyil Cs Stuy: SyilGur
28 DSyil [S&P 09] DSyil offrs th following proprtis: - Dsign s on fk n trust - Signifintly migrt th influn of syil intitis - Loss (# of onsum ojt) is provl within O(D logm) vn unr worst-s ttk, whr D is th imnsion of th ojts (lss thn 10) n M is th mx # of syil intitis voting on h ojt - Th gurnt on th loss is optiml.
29 DSyil [S&P 09] DSyil offrs th following proprtis: - Dsign s on fk n trust - Signifintly migrt th influn of syil intitis - Loss (# of onsum Assumptions? ojt) is provl within O(D logm) vn unr worst-s ttk, whr D is th imnsion of th ojts (lss thn 10) n M is th mx # of syil intitis voting on h ojt - Th gurnt on th loss is optiml.
30 Assumption: Voting Bhviors Lvrging typil voting hviors of honst usrs - Hvy-til istriution of honst usrs voting hviors - Th xistn of vry tiv usrs who st mny vots % of usrs sting x vots # vots st (on vrious ojs)
31 Assumption: Voting Bhviors Lvrging typil voting hviors of honst usrs - Hvy-til istriution of honst usrs voting hviors - Th xistn of vry tiv usrs who st mny vots % of usrs sting x vots This ssumption mks sns, us this phnomnon hs n rvl in rl-worl voting systms,.g., Digg # vots st (on vrious ojs)
32 Th Dsign Insight in DSyil If usr is lry gtting nough hlp, thn o not giv thm mor rputtions This insight nls us to voi giving rputtion to syil intitis tht wnt to otin rputtions frly
33 Systm Mol Ojts to onsum r ithr goo or Vots r only positiv DSyil is ploy in prsonliz rputtion systms
34 Systm Mol 2 goo ojts 2 ojts DSyil os not know whih on is goo Eh DSyil roun hs pool of ojts: - DSyil rommns on ojt for Ali to onsum - Ali provis fk ftr onsuming th ojt - DSyil justs rputtion s on th fk
35 Systm Mol E F H G H 2 goo ojts 2 ojts Eh intity is l to st t most on vot/ojt At most M (.g., 10^10) syil intitis voting on h prout.
36 Initil Roun: Clssifying Ojts E: 0.2 F: 0.2 H: 0.2 G: 0.2 H: 0.2 Totl: 0.4 Totl: 0.2 Totl: 0.2 Totl: 0.2 Eh intity strts with initil rputtion 0.2 W fin n ojt is ovrwhlming if its rputtion >=1
37 Th First Roun E: 0.2 F: 0.2 H: 0.2 G: 0.2 H: 0.2 Totl: 0.4 Totl: 0.2 Totl: 0.2 Totl: 0.2
38 Th First Roun E: 0.2 H: 0.2 H: 0.2 G: 0.2 H: 0.2 Totl: 0.4 Totl: 0.2 Totl: 0.2 Totl: 0.2 Thr is no ovrwhlming ojt
39 Th First Roun E: 0.2 H: 0.2 H: 0.2 G: 0.2 H: 0.2 Totl: 0.4 Totl: 0.2 Totl: 0.2 Totl: 0.2 Thr is no ovrwhlming ojt 1. Rommn rnom ojt to Ali 2. Ajust rputtion ftr th fk - if oj is, multiply rputtion of votrs y if oj is goo, multiply rputtion of votrs y 2
40 Th First Roun E: 0.2 H: 0.2 H: 0.2 G: 0.2 H: 0.2 Totl: 0.4 Totl: 0.2 Totl: 0.2 Totl: 0.2 Thr is no ovrwhlming ojt 1. Rommn rnom ojt to Ali 2. Ajust rputtion ftr th fk - if oj is, multiply rputtion of votrs y if oj is goo, multiply rputtion of votrs y 2
41 Th First Roun E: 0.4 H: 0.4 H: 0.4 G: 0.2 H: 0.4 Totl: 0.8 Totl: 0.4 Totl: 0.2 Totl: 0.4 Thr is no ovrwhlming ojt 1. Rommn rnom ojt to Ali 2. Ajust rputtion ftr th fk - if oj is, multiply rputtion of votrs y if oj is goo, multiply rputtion of votrs y 2
42 Th Son Roun B: 0.2 F: 0.2 E: 0.4 H: 0.4 H: 0.4 C: 0.2 Totl: 0.4 Totl: 0.8 Totl: 0.6
43 Th Son Roun B: 0.2 F: 0.2 E: 0.4 H: 0.4 H: 0.4 C: 0.2 Totl: 0.4 Totl: 0.8 Totl: 0.6 Thr is no ovrwhlming ojt 1. Rommn rnom ojt to Ali 2. Ajust rputtion ftr th fk - if oj is, multiply rputtion of votrs y if oj is goo, multiply rputtion of votrs y 2
44 Th Son Roun B: 0.2 F: 0.2 E: 0.4 H: 0.4 H: 0.4 C: 0.2 Totl: 0.4 Totl: 0.8 Totl: 0.6 Thr is no ovrwhlming ojt 1. Rommn rnom ojt to Ali 2. Ajust rputtion ftr th fk - if oj is, multiply rputtion of votrs y if oj is goo, multiply rputtion of votrs y 2
45 Th Son Roun B: 0.2 F: 0.2 E: 0.8 H: 0.8 H: 0.8 C: 0.2 Totl: 0.4 Totl: 1.6 Totl: 1 Thr is no ovrwhlming ojt 1. Rommn rnom ojt to Ali 2. Ajust rputtion ftr th fk - if oj is, multiply rputtion of votrs y if oj is goo, multiply rputtion of votrs y 2
46 Th Thir Roun E: 0.8 H: 0.8 B: 0.2 H: 0.8 G: 0.2 H: 0.8 Totl: 1.6 Totl: 0.4 Totl: 1 Totl: 0.8 Thr r ovrwhlming ojts
47 Th Thir Roun E: 0.8 H: 0.8 B: 0.2 H: 0.8 G: 0.2 H: 0.8 Totl: 1.6 Totl: 0.4 Totl: 1 Totl: 0.8 Thr r ovrwhlming ojts 1. Rommn Ali rnom ovrwhlming ojt 2. Ajust rputtion ftr th fk - if oj is, multiply rputtion of votrs y if oj is goo, no itionl rputtion givn out (insight #2)
48 Th Thir Roun E: 0.8 H: 0.8 B: 0.2 H: 0.8 G: 0.2 H: 0.8 Totl: 1.6 Totl: 0.4 Totl: 1 Totl: 0.8 Thr r ovrwhlming ojts 1. Rommn Ali rnom ovrwhlming ojt 2. Ajust rputtion ftr th fk - if oj is, multiply rputtion of votrs y if oj is goo, no itionl rputtion givn out (insight #2)
49 Th Thir Roun E: 0.8 H: 0.8 B: 0.2 H: 0.8 G: 0.2 H: 0.8 Totl: 1.6 Totl: 0.4 Totl: 1 Totl: 0.8 Thr r ovrwhlming ojts 1. Rommn Ali rnom ovrwhlming ojt 2. Ajust rputtion ftr th fk - if oj is, multiply rputtion of votrs y if oj is goo, no itionl rputtion givn out (insight #2)
50 Th Thir Roun E: 0.8 H: 0.8 B: 0.2 H: 0.8 G: 0.2 H: 0.8 Totl: 1.6 Totl: 0.4 Totl: 1 Totl: 0.8 Thr r ovrwhlming ojts 1. Rommn Ali rnom ovrwhlming ojt 2. Ajust rputtion ftr th fk - if oj is, multiply rputtion of votrs y if oj is goo, no itionl rputtion givn out (insight #2)
51 Th Thir Roun E: 0.8 H: 0.4 B: 0.2 H: 0.4 G: 0.1 H: 0.8 Totl: 1.2 Totl: 0.4 Totl: 0.5 Totl: 0.8 Thr r ovrwhlming ojts 1. Rommn Ali rnom ovrwhlming ojt 2. Ajust rputtion ftr th fk - if oj is, multiply rputtion of votrs y if oj is goo, no itionl rputtion givn out (insight #2)
52 Th Fourth Roun E: 0.8 H: 0.4 B: 0.2 H: 0.4 G: 0.1 H: 0.8 Totl: 1.2 Totl: 0.4 Totl: 0.5 Totl: 0.8 Thr is on ovrwhlming ojt 1. Rommn Ali rnom ovrwhlming ojt 2. Ajust rputtion ftr th fk - if oj is, multiply rputtion of votrs y if oj is goo, no itionl rputtion givn out (insight #2)
53 Why DSyil works?
54 Rll: Th First Insight in DSyil Lvrging typil voting hviors of honst usrs - Hvy-til istriution of honst usrs voting hviors - Th xistn of vry tiv usrs who st mny vots % of usrs sting x vots # vots st (on vrious ojs)
55 Why DSyil works? X A X X X B B C F B C F B C F C F B C F B C F B C F C F B C F Thr is st onsisting of svrl usrs who vot th mjority of goo ojts
56 Why DSyil works? X A X C X C C X B B C F B C F B C F C F B C F B C F B C F C F B C F Thr is st onsisting of svrl usrs who vot th mjority of goo ojts
57 Ltur Romp Syil Attks Syil Dfnss Cs Stuy: DSyil Cs Stuy: SyilGur
58 SyilGur [SIGCOMM 06] SyilGur uss soil ntwork to tt syil intitis: - Rjt proviing srvis to syil intitis - Rly on soil ntwork - Gnrl to ny ntrliz systm snrio Thr is no solution pl of nling you to voi syil ttks ompltly
59 Soil Ntworks
60 Lvrging Soil Ntworks Unirt grph Nos = intitis Egs = strong trust -.g., ollgus n frin rltionships
61 Lvrging Soil Ntworks n honst usrs: On intity/no h Mliious usrs: Multipl intitis h (syil nos) honst nos ttk gs syil nos mliious usr Syil nos my ollu
62 Lvrging Soil Ntworks n honst usrs: On intity/no h Mliious usrs: Multipl intitis h (syil nos) honst nos ttk gs syil nos mliious usr Syil nos my ollu Ky Insight: It is iffiult for ttkrs to rt xtr gs twn honst nos n syil nos
63 Ky Insight honst nos syil nos Smll uts Cll ttk g Connting two lrg groups But nnot srh for suh ut whih is NP-hr prolm
64 Gol of Syil Dfns Gol: Enl vrifir no to i whthr to pt nothr suspt no - Apt: Provi srvi to/riv srvi from - Iliz gurnt: An honst no pts n only pts othr honst nos SyilGur: - Bouns th numr of syil nos pt - Gurnts r with high proility - Approh: Aptn s on rnom rout intrstion twn vrifir n suspt nos
65 Gol of Syil Dfns Gol: Enl vrifir no to i whthr to pt nothr suspt no - Apt: Provi srvi to/riv srvi from - Iliz gurnt: An honst no pts n only pts othr honst nos SyilGur: - Bouns th numr of syil nos pt - Gurnts r with high proility - Approh: Aptn s on rnom rout intrstion twn vrifir n suspt nos
66 Gol of Syil Dfns Gol: Enl vrifir no to i whthr to pt nothr suspt no - Apt: Provi srvi to/riv srvi from - Iliz gurnt: An honst no pts n only Not tht rnom rout is iffrnt from rnom wlk!!! pts othr honst nos SyilGur: - Bouns th numr of syil nos pt - Gurnts r with high proility - Approh: Aptn s on rnom rout intrstion twn vrifir n suspt nos
67 Rnom Wlk f
68 Rnom Wlk f
69 Rnom Wlk f
70 Rnom Wlk f
71 Rnom Wlk f
72 Rnom Wlk f
73 Rnom Wlk f
74 Rnom Wlk f
75 SyilGur uss Rnom Rout f Rnomiz routing tl: - Rnom 1 to 1 mpping twn inoming n outgoing gs - Routs mrg if rossing th sm g
76 Rnom Rout f
77 Rnom Rout f
78 Rnom Rout f
79 Rnom Rout f
80 Rnom Rout f
81 Rnom Rout f
82 Rnom Rout f
83 Rnom Rout f
84 Rnom Rout f
85 Rnom Rout f
86 Rnom Rout f Bk-trl: - If w know th rout trvrss g, w know th whol rout
87 Bk-trl f
88 Bk-trl f
89 Bk-trl f
90 SyilGur Working Prinipl Suspt Vrifir honst nos syil nos Both V n S rnomly hoos nighors to lunh rnom routs Vrifir pts suspt if /2 intrstions twn routs - Rout lngth w - Vrifir s rout stys in honst rgion - Routs from two honst nos intrst
91 Rnom Rout Intrstion: Norml Suspt Vrifir honst nos syil nos Both V n S rnomly hoos nighors to lunh rnom routs Vrifir pts suspt if /2 intrstions twn routs - Rout lngth w - Vrifir s rout stys in honst rgion - Routs from two honst nos intrst
92 Rnom Rout Intrstion: Syil SyilGur ouns th numr of pt syil nos within g*w: - g: Numr of ttk gs - w: Lngth of rnom routs Vrifir sm intrstion Suspt Provl gurnts: honst nos syil nos - Convrgn proprty to oun th numr of intrstions within g - Bk-trl proprty to oun th numr of pt syil nos pr intrstion within w
93 Rnom Rout Intrstion: Syil SyilGur ouns th numr of pt syil nos within g*w: - g: Numr of ttk gs - w: Lngth of rnom routs Vrifir sm intrstion Suspt Provl gurnts: honst nos syil nos - Convrgn proprty to oun th numr of intrstions within g - Bk-trl proprty to oun th numr of pt syil nos pr intrstion within w
94 Boun # Intrstions Within g Must ross ttk g to intrst vn if syil nos o not follow th protool Vrifir Suspt sm intrstion honst nos syil nos
95 Boun # Intrstions Within g Must ross ttk g to intrst vn if syil nos o not follow th protool Vrifir sm intrstion Suspt Convrgn: Eh ttk g givs on intrstion t most g honst nos syil nos
96 Rnom Rout Intrstion: Syil SyilGur ouns th numr of pt syil nos within g*w: - g: Numr of ttk gs - w: Lngth of rnom routs Vrifir sm intrstion Suspt Provl gurnts: - Convrgn proprty to oun th numr of intrstions within g - Bk-trl proprty to oun th numr of pt syil nos pr intrstion within w honst nos syil nos
97 Boun # Syil Nos Apt within w Suspt Vrifir Bk-trl: - Eh intrstion shoul orrspon to routs from t most w honst nos - Vrifir pts t most w nos pr intrstion honst nos syil nos
98 SyilGur Summry SyilGur uss soil ntwork to tt syil intitis: - Assumption: Soil ntwork, smll uts, n fst-mixing - Honst no pts <= g*w syil nos - Gnrl to ny ntrliz snrio
99 SyilGur Summry SyilGur uss soil ntwork to tt syil intitis: - Assumption: Soil ntwork, smll uts, n fst-mixing - Honst no pts <= g*w syil nos - Gnrl to ny ntrliz snrio Cn I mk g=1 n w=1?
100 Nxt Ltur In th l-7, I will ovr: - Glol srvis om populr - W wnt to ontrol mor - How o Firwll n NAT work? - How to ontrol ntrpris-sl ntwork?
V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}
Introution Computr Sin & Enginring 423/823 Dsign n Anlysis of Algorithms Ltur 03 Elmntry Grph Algorithms (Chptr 22) Stphn Sott (Apt from Vinohnrn N. Vriym) I Grphs r strt t typs tht r pplil to numrous
CSE 373: More on graphs; DFS and BFS. Michael Lee Wednesday, Feb 14, 2018
CSE 373: Mor on grphs; DFS n BFS Mihl L Wnsy, F 14, 2018 1 Wrmup Wrmup: Disuss with your nighor: Rmin your nighor: wht is simpl grph? Suppos w hv simpl, irt grph with x nos. Wht is th mximum numr of gs
Why the Junction Tree Algorithm? The Junction Tree Algorithm. Clique Potential Representation. Overview. Chris Williams 1.
Why th Juntion Tr lgorithm? Th Juntion Tr lgorithm hris Willims 1 Shool of Informtis, Univrsity of Einurgh Otor 2009 Th JT is gnrl-purpos lgorithm for omputing (onitionl) mrginls on grphs. It os this y
12/3/12. Outline. Part 10. Graphs. Circuits. Euler paths/circuits. Euler s bridge problem (Bridges of Konigsberg Problem)
12/3/12 Outlin Prt 10. Grphs CS 200 Algorithms n Dt Struturs Introution Trminology Implmnting Grphs Grph Trvrsls Topologil Sorting Shortst Pths Spnning Trs Minimum Spnning Trs Ciruits 1 Ciruits Cyl 2 Eulr
V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}
s s of s Computr Sin & Enginring 423/823 Dsign n Anlysis of Ltur 03 (Chptr 22) Stphn Sott (Apt from Vinohnrn N. Vriym) s of s s r strt t typs tht r pplil to numrous prolms Cn ptur ntitis, rltionships twn
5/9/13. Part 10. Graphs. Outline. Circuits. Introduction Terminology Implementing Graphs
Prt 10. Grphs CS 200 Algorithms n Dt Struturs 1 Introution Trminology Implmnting Grphs Outlin Grph Trvrsls Topologil Sorting Shortst Pths Spnning Trs Minimum Spnning Trs Ciruits 2 Ciruits Cyl A spil yl
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. {, } {, } {, } {, } {, } {,
Module graph.py. 1 Introduction. 2 Graph basics. 3 Module graph.py. 3.1 Objects. CS 231 Naomi Nishimura
Moul grph.py CS 231 Nomi Nishimur 1 Introution Just lik th Python list n th Python itionry provi wys of storing, ssing, n moifying t, grph n viw s wy of storing, ssing, n moifying t. Bus Python os not
Graph Isomorphism. Graphs - II. Cayley s Formula. Planar Graphs. Outline. Is K 5 planar? The number of labeled trees on n nodes is n n-2
Grt Thortil Is In Computr Sin Vitor Amhik CS 15-251 Ltur 9 Grphs - II Crngi Mllon Univrsity Grph Isomorphism finition. Two simpl grphs G n H r isomorphi G H if thr is vrtx ijtion V H ->V G tht prsrvs jny
1 Introduction to Modulo 7 Arithmetic
1 Introution to Moulo 7 Arithmti Bor w try our hn t solvin som hr Moulr KnKns, lt s tk los look t on moulr rithmti, mo 7 rithmti. You ll s in this sminr tht rithmti moulo prim is quit irnt rom th ons w
CSC Design and Analysis of Algorithms. Example: Change-Making Problem
CSC 801- Dsign n Anlysis of Algorithms Ltur 11 Gry Thniqu Exmpl: Chng-Mking Prolm Givn unlimit mounts of oins of nomintions 1 > > m, giv hng for mount n with th lst numr of oins Exmpl: 1 = 25, 2 =10, =
CS200: Graphs. Graphs. Directed Graphs. Graphs/Networks Around Us. What can this represent? Sometimes we want to represent directionality:
CS2: Grphs Prihr Ch. 4 Rosn Ch. Grphs A olltion of nos n gs Wht n this rprsnt? n A omputr ntwork n Astrtion of mp n Soil ntwork CS2 - Hsh Tls 2 Dirt Grphs Grphs/Ntworks Aroun Us A olltion of nos n irt
CSE 373: AVL trees. Warmup: Warmup. Interlude: Exploring the balance invariant. AVL Trees: Invariants. AVL tree invariants review
rmup CSE 7: AVL trs rmup: ht is n invrint? Mihl L Friy, Jn 9, 0 ht r th AVL tr invrints, xtly? Disuss with your nighor. AVL Trs: Invrints Intrlu: Exploring th ln invrint Cor i: xtr invrint to BSTs tht
Outline. 1 Introduction. 2 Min-Cost Spanning Trees. 4 Example
Outlin Computr Sin 33 Computtion o Minimum-Cost Spnnin Trs Prim's Alorithm Introution Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #33 3 Alorithm Gnrl Constrution Mik Joson (Univrsity o Clry)
Algorithmic and NP-Completeness Aspects of a Total Lict Domination Number of a Graph
Intrntionl J.Mth. Comin. Vol.1(2014), 80-86 Algorithmi n NP-Compltnss Aspts of Totl Lit Domintion Numr of Grph Girish.V.R. (PES Institut of Thnology(South Cmpus), Bnglor, Krntk Stt, Ini) P.Ush (Dprtmnt
Outline. Circuits. Euler paths/circuits 4/25/12. Part 10. Graphs. Euler s bridge problem (Bridges of Konigsberg Problem)
4/25/12 Outlin Prt 10. Grphs CS 200 Algorithms n Dt Struturs Introution Trminology Implmnting Grphs Grph Trvrsls Topologil Sorting Shortst Pths Spnning Trs Minimum Spnning Trs Ciruits 1 2 Eulr s rig prolm
ECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS
C 24 - COMBINATIONAL BUILDING BLOCKS - INVST 3 DCODS AND NCODS FALL 23 AP FLZ To o "wll" on this invstition you must not only t th riht nswrs ut must lso o nt, omplt n onis writups tht mk ovious wht h
Motivation. 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
Garnir 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,
Graphs. CSC 1300 Discrete Structures Villanova University. Villanova CSC Dr Papalaskari
Grphs CSC 1300 Disrt Struturs Villnov Univrsity Grphs Grphs r isrt struturs onsis?ng of vr?s n gs tht onnt ths vr?s. Grphs n us to mol: omputr systms/ntworks mthm?l rl?ons logi iruit lyout jos/prosss f
Section 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
CSE 373. Graphs 1: Concepts, Depth/Breadth-First Search reading: Weiss Ch. 9. slides created by Marty Stepp
CSE 373 Grphs 1: Conpts, Dpth/Brth-First Srh ring: Wiss Ch. 9 slis rt y Mrty Stpp http://www.s.wshington.u/373/ Univrsity o Wshington, ll rights rsrv. 1 Wht is grph? 56 Tokyo Sttl Soul 128 16 30 181 140
12. 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}
Planar Upward Drawings
C.S. 252 Pro. Rorto Tmssi Computtionl Gomtry Sm. II, 1992 1993 Dt: My 3, 1993 Sri: Shmsi Moussvi Plnr Upwr Drwings 1 Thorm: G is yli i n only i it hs upwr rwing. Proo: 1. An upwr rwing is yli. Follow th
Cycles and Simple Cycles. Paths and Simple Paths. Trees. Problem: There is No Completely Standard Terminology!
Outlin Computr Sin 331, Spnnin, n Surphs Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #30 1 Introution 2 3 Dinition 4 Spnnin 5 6 Mik Joson (Univrsity o Clry) Computr Sin 331 Ltur #30 1 / 20 Mik
Graphs. Graphs. Graphs: Basic Terminology. Directed Graphs. Dr Papalaskari 1
CSC 00 Disrt Struturs : Introuon to Grph Thory Grphs Grphs CSC 00 Disrt Struturs Villnov Univrsity Grphs r isrt struturs onsisng o vrs n gs tht onnt ths vrs. Grphs n us to mol: omputr systms/ntworks mthml
Solutions for HW11. Exercise 34. (a) Use the recurrence relation t(g) = t(g e) + t(g/e) to count the number of spanning trees of v 1
Solutions for HW Exris. () Us th rurrn rltion t(g) = t(g ) + t(g/) to ount th numr of spnning trs of v v v u u u Rmmr to kp multipl gs!! First rrw G so tht non of th gs ross: v u v Rursing on = (v, u ):
(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,
0.1. Exercise 1: the distances between four points in a graph
Mth 707 Spring 2017 (Drij Grinrg): mitrm 3 pg 1 Mth 707 Spring 2017 (Drij Grinrg): mitrm 3 u: W, 3 My 2017, in lss or y mil (grinr@umn.u) or lss S th wsit or rlvnt mtril. Rsults provn in th nots, or in
An undirected graph G = (V, E) V a set of vertices E a set of unordered edges (v,w) where v, w in V
Unirt Grphs An unirt grph G = (V, E) V st o vrtis E st o unorr gs (v,w) whr v, w in V USE: to mol symmtri rltionships twn ntitis vrtis v n w r jnt i thr is n g (v,w) [or (w,v)] th g (v,w) is inint upon
EE1000 Project 4 Digital Volt Meter
Ovrviw EE1000 Projt 4 Diitl Volt Mtr In this projt, w mk vi tht n msur volts in th rn o 0 to 4 Volts with on iit o ury. Th input is n nlo volt n th output is sinl 7-smnt iit tht tlls us wht tht input s
Exam 1 Solution. CS 542 Advanced Data Structures and Algorithms 2/14/2013
CS Avn Dt Struturs n Algorithms Exm Solution Jon Turnr //. ( points) Suppos you r givn grph G=(V,E) with g wights w() n minimum spnning tr T o G. Now, suppos nw g {u,v} is to G. Dsri (in wors) mtho or
CS 461, Lecture 17. Today s Outline. Example Run
Prim s Algorithm CS 461, Ltur 17 Jr Si Univrsity o Nw Mxio In Prim s lgorithm, th st A mintin y th lgorithm orms singl tr. Th tr strts rom n ritrry root vrtx n grows until it spns ll th vrtis in V At h
Math 61 : Discrete Structures Final Exam Instructor: Ciprian Manolescu. You have 180 minutes.
Nm: UCA ID Numr: Stion lttr: th 61 : Disrt Struturs Finl Exm Instrutor: Ciprin nolsu You hv 180 minuts. No ooks, nots or lultors r llow. Do not us your own srth ppr. 1. (2 points h) Tru/Fls: Cirl th right
COMPLEXITY OF COUNTING PLANAR TILINGS BY TWO BARS
OMPLXITY O OUNTING PLNR TILINGS Y TWO RS KYL MYR strt. W show tht th prolm o trmining th numr o wys o tiling plnr igur with horizontl n vrtil r is #P-omplt. W uil o o th rsults o uquir, Nivt, Rmil, n Roson
# 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
QUESTIONS BEGIN HERE!
Points miss: Stunt's Nm: Totl sor: /100 points Est Tnnss Stt Univrsity Dprtmnt o Computr n Inormtion Sins CSCI 2710 (Trno) Disrt Struturs TEST or Sprin Smstr, 2005 R this or strtin! This tst is los ook
The University of Sydney MATH2969/2069. Graph Theory Tutorial 5 (Week 12) Solutions 2008
Th Univrsity o Syny MATH2969/2069 Grph Thory Tutoril 5 (Wk 12) Solutions 2008 1. (i) Lt G th isonnt plnr grph shown. Drw its ul G, n th ul o th ul (G ). (ii) Show tht i G is isonnt plnr grph, thn G is
Walk 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
Outline. Computer Science 331. Computation of Min-Cost Spanning Trees. Costs of Spanning Trees in Weighted Graphs
Outlin Computr Sin 33 Computtion o Minimum-Cost Spnnin Trs Prim s Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #34 Introution Min-Cost Spnnin Trs 3 Gnrl Constrution 4 5 Trmintion n Eiiny 6 Aitionl
More 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 ({,,,,}, {{,}, {,},
A 4-state solution to the Firing Squad Synchronization Problem based on hybrid rule 60 and 102 cellular automata
A 4-stt solution to th Firing Squ Synhroniztion Prolm s on hyri rul 60 n 102 llulr utomt LI Ning 1, LIANG Shi-li 1*, CUI Shung 1, XU Mi-ling 1, ZHANG Ling 2 (1. Dprtmnt o Physis, Northst Norml Univrsity,
Weighted 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 ) >.
CS61B Lecture #33. Administrivia: Autograder will run this evening. Today s Readings: Graph Structures: DSIJ, Chapter 12
Aministrivi: CS61B Ltur #33 Autogrr will run this vning. Toy s Rings: Grph Struturs: DSIJ, Chptr 12 Lst moifi: W Nov 8 00:39:28 2017 CS61B: Ltur #33 1 Why Grphs? For xprssing non-hirrhilly rlt itms Exmpls:
Integration 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
Using 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
a 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
QUESTIONS BEGIN HERE!
Points miss: Stunt's Nm: Totl sor: /100 points Est Tnnss Stt Univrsity Dprtmnt of Computr n Informtion Sins CSCI 710 (Trnoff) Disrt Struturs TEST for Fll Smstr, 00 R this for strtin! This tst is los ook
Section 10.4 Connectivity (up to paths and isomorphism, not including)
Toy w will isuss two stions: Stion 10.3 Rprsnting Grphs n Grph Isomorphism Stion 10.4 Conntivity (up to pths n isomorphism, not inluing) 1 10.3 Rprsnting Grphs n Grph Isomorphism Whn w r working on n lgorithm
Present state Next state Q + M N
Qustion 1. An M-N lip-lop works s ollows: I MN=00, th nxt stt o th lip lop is 0. I MN=01, th nxt stt o th lip-lop is th sm s th prsnt stt I MN=10, th nxt stt o th lip-lop is th omplmnt o th prsnt stt I
Constructive Geometric Constraint Solving
Construtiv Gomtri Constrint Solving Antoni Soto i Rir Dprtmnt Llngutgs i Sistms Inormàtis Univrsitt Politèni Ctluny Brlon, Sptmr 2002 CGCS p.1/37 Prliminris CGCS p.2/37 Gomtri onstrint prolm C 2 D L BC
COMP108 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
b. How many ternary words of length 23 with eight 0 s, nine 1 s and six 2 s?
MATH 3012 Finl Exm, My 4, 2006, WTT Stunt Nm n ID Numr 1. All our prts o this prolm r onrn with trnry strings o lngth n, i.., wors o lngth n with lttrs rom th lpht {0, 1, 2}.. How mny trnry wors o lngth
, 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
Similarity 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
DUET WITH DIAMONDS COLOR SHIFTING BRACELET By Leslie Rogalski
Dut with Dimons Brlt DUET WITH DIAMONDS COLOR SHIFTING BRACELET By Lsli Roglski Photo y Anrw Wirth Supruo DUETS TM from BSmith rt olor shifting fft tht mks your work tk on lif of its own s you mov! This
CS September 2018
Loil los Distriut Systms 06. Loil los Assin squn numrs to msss All ooprtin prosss n r on orr o vnts vs. physil los: rport tim o y Assum no ntrl tim sour Eh systm mintins its own lol lo No totl orrin o
Ch 1.2: Solutions of Some Differential Equations
Ch 1.2: Solutions of Som Diffrntil Equtions Rcll th fr fll nd owl/mic diffrntil qutions: v 9.8.2v, p.5 p 45 Ths qutions hv th gnrl form y' = y - b W cn us mthods of clculus to solv diffrntil qutions of
S i m p l i f y i n g A l g e b r a SIMPLIFYING ALGEBRA.
S i m p l i y i n g A l g r SIMPLIFYING ALGEBRA www.mthltis.o.nz Simpliying SIMPLIFYING Algr ALGEBRA Algr is mthmtis with mor thn just numrs. Numrs hv ix vlu, ut lgr introus vrils whos vlus n hng. Ths
Problem solving by search
Prolm solving y srh Tomáš voo Dprtmnt o Cyrntis, Vision or Roots n Autonomous ystms Mrh 5, 208 / 3 Outlin rh prolm. tt sp grphs. rh trs. trtgis, whih tr rnhs to hoos? trtgy/algorithm proprtis? Progrmming
What do you know? Listen and find. Listen and circle. Listen and chant. Listen and say. Lesson 1. sheep. horse
Animls shp T h i nk Wht o you know? 2 2:29 Listn n fin. hors Wht s this? Wht s this? It s got ig nos. It s ig n gry. It s hors! YES! 2 Wht r ths? Wht r ths? Thy v got two lgs. Thy r smll n rown. Thy r
Announcements. Not graphs. These are Graphs. Applications of Graphs. Graph Definitions. Graphs & Graph Algorithms. A6 released today: Risk
Grphs & Grph Algorithms Ltur CS Spring 6 Announmnts A6 rls toy: Risk Strt signing with your prtnr sp Prlim usy Not grphs hs r Grphs K 5 K, =...not th kin w mn, nywy Applitions o Grphs Communition ntworks
Seven-Segment Display Driver
7-Smnt Disply Drivr, Ron s in 7-Smnt Disply Drivr, Ron s in Prolm 62. 00 0 0 00 0000 000 00 000 0 000 00 0 00 00 0 0 0 000 00 0 00 BCD Diits in inry Dsin Drivr Loi 4 inputs, 7 outputs 7 mps, h with 6 on
FSA. CmSc 365 Theory of Computation. Finite State Automata and Regular Expressions (Chapter 2, Section 2.3) ALPHABET operations: U, concatenation, *
CmSc 365 Thory of Computtion Finit Stt Automt nd Rgulr Exprssions (Chptr 2, Sction 2.3) ALPHABET oprtions: U, conctntion, * otin otin Strings Form Rgulr xprssions dscri Closd undr U, conctntion nd * (if
4.1 Interval Scheduling. Chapter 4. Greedy Algorithms. Interval Scheduling: Greedy Algorithms. Interval Scheduling. Interval scheduling.
Cptr 4 4 Intrvl Suln Gry Alortms Sls y Kvn Wyn Copyrt 005 Prson-Ason Wsly All rts rsrv Intrvl Suln Intrvl Suln: Gry Alortms Intrvl suln! Jo strts t s n nss t! Two os omptl ty on't ovrlp! Gol: n mxmum sust
Numbering 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
CS 241 Analysis of Algorithms
CS 241 Anlysis o Algorithms Prossor Eri Aron Ltur T Th 9:00m Ltur Mting Lotion: OLB 205 Businss HW6 u lry HW7 out tr Thnksgiving Ring: Ch. 22.1-22.3 1 Grphs (S S. B.4) Grphs ommonly rprsnt onntions mong
Chapter 9. Graphs. 9.1 Graphs
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.
Register 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,
Aquauno Video 6 Plus Page 1
Connt th timr to th tp. Aquuno Vio 6 Plus Pg 1 Usr mnul 3 lik! For Aquuno Vio 6 (p/n): 8456 For Aquuno Vio 6 Plus (p/n): 8413 Opn th timr unit y prssing th two uttons on th sis, n fit 9V lklin ttry. Whn
Minimum Spanning Trees
Minimum Spnning Trs Minimum Spnning Trs Problm A town hs st of houss nd st of rods A rod conncts nd only houss A rod conncting houss u nd v hs rpir cost w(u, v) Gol: Rpir nough (nd no mor) rods such tht:
Register 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
Last 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
Page 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
Weighted Graphs. Weighted graphs may be either directed or undirected.
1 In mny ppltons, o rp s n ssot numrl vlu, ll wt. Usully, t wts r nonntv ntrs. Wt rps my tr rt or unrt. T wt o n s otn rrr to s t "ost" o t. In ppltons, t wt my msur o t lnt o rout, t pty o ln, t nry rqur
CSE 332. Sorting. Data Abstractions. CSE 332: Data Abstractions. QuickSort Cutoff 1. Where We Are 2. Bounding The MAXIMUM Problem 4
Am Blnk Leture 13 Winter 2016 CSE 332 CSE 332: Dt Astrtions Sorting Dt Astrtions QuikSort Cutoff 1 Where We Are 2 For smll n, the reursion is wste. The onstnts on quik/merge sort re higher thn the ones
A 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
Improving Union. Implementation. Union-by-size Code. Union-by-Size Find Analysis. Path Compression! Improving Find find(e)
POW CSE 36: Dt Struturs Top #10 T Dynm (Equvln) Duo: Unon-y-Sz & Pt Comprsson Wk!! Luk MDowll Summr Qurtr 003 M! ZING Wt s Goo Mz? Mz Construton lortm Gvn: ollton o rooms V Conntons twn t rooms (ntlly
Multipoint Alternate Marking method for passive and hybrid performance monitoring
Multipoint Altrnt Mrkin mtho or pssiv n hyri prormn monitorin rt-iool-ippm-multipoint-lt-mrk-00 Pru, Jul 2017, IETF 99 Giuspp Fiool (Tlom Itli) Muro Coilio (Tlom Itli) Amo Spio (Politnio i Torino) Riro
Graph Contraction and Connectivity
Chptr 17 Grph Contrtion n Conntivity So r w hv mostly ovr thniqus or solving prolms on grphs tht wr vlop in th ontxt o squntil lgorithms. Som o thm r sy to prllliz whil othrs r not. For xmpl, w sw tht
Steinberg s Conjecture is false
Stinrg s Conjtur is als arxiv:1604.05108v2 [math.co] 19 Apr 2016 Vinnt Cohn-Aa Mihal Hig Danil Král Zhntao Li Estan Salgao Astrat Stinrg onjtur in 1976 that vry planar graph with no yls o lngth our or
This 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
Analysis 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
5/7/13. Part 10. Graphs. Theorem Theorem Graphs Describing Precedence. Outline. Theorem 10-1: The Handshaking Theorem
Thorm 10-1: Th Hnshkin Thorm Lt G=(V,E) n unirt rph. Thn Prt 10. Grphs CS 200 Alorithms n Dt Struturs v V (v) = 2 E How mny s r thr in rph with 10 vrtis h of r six? 10 * 6 /2= 30 1 Thorm 10-2 An unirt
CS 103 BFS Alorithm. Mark Redekopp
CS 3 BFS Aloritm Mrk Rkopp Brt-First Sr (BFS) HIGHLIGHTED ALGORITHM 3 Pt Plnnin W'v sn BFS in t ontxt o inin t sortst pt trou mz? S?? 4 Pt Plnnin W xplor t 4 niors s on irtion 3 3 3 S 3 3 3 3 3 F I you
Nefertiti. Echoes of. Regal components evoke visions of the past MULTIPLE STITCHES. designed by Helena Tang-Lim
MULTIPLE STITCHES Nrtiti Ehos o Rgl omponnts vok visions o th pst sign y Hln Tng-Lim Us vrity o stiths to rt this rgl yt wrl sign. Prt sping llows squr s to mk roun omponnts tht rp utiully. FCT-SC-030617-07
Enforcement of Opacity Security Properties Using Insertion Functions
Enforcmnt of Opcity Scurity Proprtis Using Insrtion Functions Yi-Chin Wu nd Stéphn Lfortun EECS Dprtmnt, Univrsity of Michign CDC 12 Dc. 13 th, 2012 Motivtion Scurity nd privcy concrns in onlin srvics
CSE303 - 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
Instructions for Section 1
Instructions for Sction 1 Choos th rspons tht is corrct for th qustion. A corrct nswr scors 1, n incorrct nswr scors 0. Mrks will not b dductd for incorrct nswrs. You should ttmpt vry qustion. No mrks
Designing A Concrete Arch Bridge
This is th mous Shwnh ri in Switzrln, sin y Rort Millrt in 1933. It spns 37.4 mtrs (122 t) n ws sin usin th sm rphil mths tht will monstrt in this lsson. To pro with this lsson, lik on th Nxt utton hr
(a) v 1. v a. v i. v s. (b)
Outlin RETIMING Struturl optimiztion mthods. Gionni D Mihli Stnford Unirsity Rtiming. { Modling. { Rtiming for minimum dly. { Rtiming for minimum r. Synhronous Logi Ntwork Synhronous Logi Ntwork Synhronous
Construction 11: Book I, Proposition 42
Th Visul Construtions of Euli Constrution #11 73 Constrution 11: Book I, Proposition 42 To onstrut, in givn rtilinl ngl, prlllogrm qul to givn tringl. Not: Equl hr mns qul in r. 74 Constrution # 11 Th
N=4 L=4. Our first non-linear data structure! A graph G consists of two sets G = {V, E} A set of V vertices, or nodes f
lulu jwtt pnlton sin towr ounrs hpl lpp lu Our irst non-linr t strutur! rph G onsists o two sts G = {V, E} st o V vrtis, or nos st o E s, rltionships twn nos surph G onsists o sust o th vrtis n s o G jnt
In 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
INTEGRALS. 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..
Lecture 20: Minimum Spanning Trees (CLRS 23)
Ltur 0: Mnmum Spnnn Trs (CLRS 3) Jun, 00 Grps Lst tm w n (wt) rps (unrt/rt) n ntrou s rp voulry (vrtx,, r, pt, onnt omponnts,... ) W lso suss jny lst n jny mtrx rprsntton W wll us jny lst rprsntton unlss
Emergence of Global Network Property based on Multi-agent Voting Model
Emrgn of Glol Ntwork Proprty s on Multi-gnt Voting Mol Kosuk Shino Ntionl Dfns Amy -- Hshirimizu, Yokosuk Kngw, Jpn kshino@n..jp Yutk Mtsuo Ntionl Institut of Avn Inustril Sin n Thnology -- Sotoknn, Chiyo
Yehuda Lindell Bar-Ilan University
Wintr Shool on Sur Computtion n iiny Br-Iln Unirsity, Isrl 3//2-/2/2 Br Iln Unirsity Dpt. o Computr Sin Yhu Linll Br-Iln Unirsity Br Iln Unirsity Dpt. o Computr Sin Protool or nrl sur to-prty omputtion
Compression. Compression. Compression. This part of the course... Ifi, UiO Norsk Regnesentral Vårsemester 2005 Wolfgang Leister
Kurs INF5080 Ifi, UiO Norsk Rgnsntrl Vårsmstr 2005 Wolfgng Listr This prt of th ours...... is hl t Ifi, UiO... (Wolfgng Listr) n t ontins mtril from Univrsity Collg Krlsruh (Ptr Ol, Clmns Knorzr) Informtion
EXAMPLE 87.5" APPROVAL SHEET APPROVED BY /150HP DUAL VFD CONTROL ASSEMBLY CUSTOMER NAME: CAL POLY SLO FINISH: F 20
XMPL XMPL RVISIONS ZON RV. SRIPTION T PPROV 0.00 THIS IS N PPROVL RWING OR YOUR ORR. OR MNUTURING N GIN, THIS RWING MUST SIGN N RTURN TO MOTION INUSTRIS. NY HNGS M TO THIS RWING, TR MNUTURING HS GUN WILL