Minimum Spanning Trees
|
|
- Johnathan Powell
- 5 years ago
- Views:
Transcription
1 Yufi Tao ITEE Univrsity of Qunslan
2 In tis lctur, w will stuy anotr classic prolm: finin a minimum spannin tr of an unirct wit rap. Intrstinly, vn tou t prolm appars ratr iffrnt from SSSP (sinl sourc sortst pat), it can solv y an aloritm tat is rminiscnt of Dijkstra s aloritm.
3 Unirct Wit Graps Lt G = (V, E) an unirct rap. Lt w a function tat maps ac of G to a positiv intr valu. Spcifically, for ac, w() is a positiv intr valu, wic w call t wit of. A unirct wit rap is fin as t pair (G, w). W will not an twn vrtics u an v in G as {u, v} insta of (u, v) to mpasiz tat t orrin of u, v os not mattr. W consir tat G is connct, namly, tr is a pat twn any two vrtics in V.
4 Exampl a 7 f 8 0 c 6 T intr on ac inicats its wit. For xampl, t wit of {, } is 9, an tat of {, } is.
5 Spannin Trs Rmmr tat a tr is fin as a connct unirct rap wit no cycls. Givn a connct unirct wit rap (G, w) wit G = (V, E), a spannin tr T is a tr satisfyin t followin conitions: T vrtx st of T is V. Evry of T is an in G. T cost of T is fin as t sum of t wits of all t s in T (not tat T must av V s).
6 Exampl a 7 f 8 0 c 6 a f a f a 8 7 f c 6 c 6 c T scon row sows tr spannin trs (of t rap in t first row). T cost of t first two trs is 7, an tat of t rit tr is 48.
7 T Minimum Spannin Tr Prolm Givn a connct unirct wit rap (G, w) wit G = (V, E), t oal of t minimum spannin tr (MST) prolm is to fin a spannin tr of t smallst cost. Suc a tr is call an MST of (G, w).
8 Exampl a 7 f 8 0 c 6 a f a f c 6 c 6 Bot trs in t scon row ar MSTs. Tis mans tat MSTs may not uniqu.
9 Prim s Aloritm Nxt, w will iscuss an aloritm call Prim s aloritm for solvin t MST prolm. W assum tat G is stor in t ajacncy list format. Rcall tat an {u, v} is rprsnt twic: onc y placin u in t ajacncy list of of v, an anotr tim y placin v in t ajacncy list of u. T wit of {u, v} is stor in ot placs.
10 Prim s Aloritm T aloritm rows a tr T mst y incluin on vrtx at a tim. At any momnt, it ivis t vrtx st V into two parts: T st S of vrtics tat ar alray in T mst. T st of otr vrtics: V \ S. At t n of t aloritm, S = V. If an conncts a vrtx in V an a vrtx in V \ S, w call it an xtnsion. At all tims, t aloritm nforcs t followin litst xtnsion principl: For vry vrtx v V \ S, it rmmrs wic xtnsion of v as t smallst wit rfrr to as t litst xtnsion of v, an not as st-xt(v).
11 Prim s Aloritm. Lt {u, v} an wit t smallst wit amon all s.. St S = {u, v}. Initializ a tr T mst wit only on {u, v}.. Enforc t litst xtnsion principl: For vry vrtx z of V \ S If z is a nior of u, ut not of v st-xt(z) = {z, u} If z is a nior of v, ut not of u st-xt(z) = {z, v} Otrwis st-xt(z) = t litr twn {z, u} an {z, v}
12 Prim s Aloritm 4. Rpat t followin until S = V : 5. Gt an xtnsion {u, v} wit t smallst wit /* Witout loss of nrality, suppos u S an v / S */ 6. A v into S, an a {u, v} into T mst /* Nxt, w rstor t litst xtnsion principl. */ 7. for vry {v, z} of v: If z / S tn If st-xt(z) is avir tan {v, z} tn St st-xt(z) = {v, z}
13 Exampl E {a, } is t litst of all. So, at t innin S = {a, }. T MST w ar rowin now as on {a, }. a 7 f 8 0 c 6 vrtx v st-xt(v) an wit a c {c, a}, nil, {, }, 0 f {a, f }, 7 {, }, {a, }, 8 Not: Es {c, a} an {c, } av t sam wit. Eitr of tm can st-xt(c).
14 Exampl E {c, a} is t litst xtnsion. So, w a c to S, wic is now S = {a,, c}. A {c, a} into t MST. a 7 f 8 0 c 6 vrtx v st-xt(v) an wit a c nil, {, }, 0 f {c, f }, 5 {, }, {c, }, 6
15 Exampl E {c, f } is t litst xtnsion. So, w a f to S, wic is now S = {a,, c, f }. A {c, f } into t MST. a 7 f 8 0 c 6 vrtx v st-xt(v) an wit a c nil, {, f }, f {, }, {c, }, 6
16 Exampl E {, f } is t litst xtnsion. So, w a to S, wic is now S = {a,, c, f, }. A {, f } into t MST. a 7 f 8 0 c 6 vrtx v st-xt(v) an wit a c {, }, f {, }, {c, }, 6
17 Exampl E {c, } is t litst xtnsion. So, w a to S, wic is now S = {a,, c, f,, }. A {c, } into t MST. a 7 f 8 0 c 6 vrtx v st-xt(v) an wit a c {, }, f {, }, 9
18 Exampl E {, } is t litst xtnsion. So, w a to S, wic is now S = {a,, c, f,, }. A {, } into t MST. a 7 f 8 0 c 6 vrtx v st-xt(v) an wit a c {, }, f
19 Exampl Finally, {, } is t litst xtnsion. So, w a to S, wic is now S = {a,, c, f,,,, }. A {, } into t MST. a 7 f 8 0 c 6 vrtx v a c f st-xt(v) an wit W av otain our final MST.
20 Nxt w will prov tat t aloritm is corrct, namly, t tr output is in an MST. W will o so y inuction on t squnc of t s a to t tr. Spcifically, t claim to provn is: Claim: For any i [, V ], tr must an MST containin all t first i s cosn y our aloritm. Tn t aloritm s corrctnss follows from t aov claim at i = V.
21 Corrctnss Proof Lt us first rcall a funamntal proprty of unirct raps: Lmma: Lt T a tr of n vrtics. Ain an aritrary twn two vrtics in T introucs a cycl. Proof: Suppos tat t is a twn u an v. Bfor t was a, tr is alray a pat allowin us to o from u to v in T. Trfor, t {u, v} allows us to mov from v ack to u, tus witnssin a cycl.
22 Corrctnss Proof Now w proc to prov t claim on Sli 0. Bas Cas: i =. Lt {u, v} an wit t smallst wit in t rap. W will prov tat t must xist in som MST. Tak any MST T tat os not contain {u, v}. A t to T, wic crats a cycl. Rmov an aritrary in T suc tat {u, v}, wic ivs a nw tr T. Sinc {u, v} as t smallst wit, t cost of T is smallr tan or qual to tat of T. Tis mans tat T is also an MST. Hnc, t claim ols for i =.
23 Corrctnss Proof Inuctiv Cas: Assumin tat t claim ols for i k (k ), nxt w prov tat it also ols for i = k. Lt {u, v} t k-t a y our aloritm, an S t st of vrtics alray in t aloritm s tr for t aition of {u, v}. Witout loss of nrality, suppos tat u S, an v / S. By t inuctiv assumption, w know tat tr is som MST T tat inclus all t first k s. If T also inclus {u, v}, tn t claim alray ols. Nxt, w consir t cas wr T os not av {u, v}.
24 Corrctnss Proof W a {u, v} to T, wic crats a cycl. Lt us walk on tis cycl startin from v, cross {u, v} into S, kp walkin witin S until travlin out of S for t first tim. Lt t tat rout us out of S {u, v }. S u v V \ S u v Not tat ot {u, v} an {u, v } ar xtnsion s rit for t momnt our aloritm picks t k-t. Sinc {u, v} as t smallst wit amon all t xtnsion s, w know tat t wit of {u, v} is smallr tan or qual to tat of {u, v }.
25 Corrctnss Proof Now, rmov {u, v } from T, wic ivs anotr tr T. T cost of T cannot mor tan tat of T. Tis mans tat T must also an MST. W tus av prov tat t claim ols for i = k as wll.
26 Runnin Tim It will lft as an xrcis for you to apply t ata structurs you av larn to implmnt Prim s aloritm in O(( V + E ) lo V ) tim. Rmark: Usin aain an avanc ata structur (call t Fionacci Hap) tat will not covr in tis cours, w can improv t runnin tim to O( V lo V + E ).
Examples and applications on SSSP and MST
Exampls an applications on SSSP an MST Dan (Doris) H & Junhao Gan ITEE Univrsity of Qunslan COMP3506/7505, Uni of Qunslan Exampls an applications on SSSP an MST Dijkstra s Algorithm Th algorithm solvs
More informationa g f 8 e 11 Also: Minimum degree, maximum degree, vertex of degree d 1 adjacent to vertex of degree d 2,...
Warmup: Lt b 2 c 3 d 1 12 6 4 5 10 9 7 a 8 11 (i) Vriy tat G is connctd by ivin an xampl o a walk rom vrtx a to ac o t vrtics b. (ii) Wat is t sortst pat rom a to c? to? (iii) Wat is t lonst pat rom a
More informationOutlines: Graphs Part-4. Applications of Depth-First Search. Directed Acyclic Graph (DAG) Generic scheduling problem.
Outlins: Graps Part-4 Applications o DFS Elmntary Grap Aloritms Topoloical Sort o Dirctd Acyclic Grap Stronly Connctd Componnts PART-4 1 2 Applications o Dpt-First Sarc Topoloical Sort: Usin dpt-irst sarc
More informationdy 1. If fx ( ) is continuous at x = 3, then 13. If y x ) for x 0, then f (g(x)) = g (f (x)) when x = a. ½ b. ½ c. 1 b. 4x a. 3 b. 3 c.
AP CALCULUS BC SUMMER ASSIGNMENT DO NOT SHOW YOUR WORK ON THIS! Complt ts problms during t last two wks of August. SHOW ALL WORK. Know ow to do ALL of ts problms, so do tm wll. Itms markd wit a * dnot
More informationThe second condition says that a node α of the tree has exactly n children if the arity of its label is n.
CS 6110 S14 Hanout 2 Proof of Conflunc 27 January 2014 In this supplmntary lctur w prov that th λ-calculus is conflunt. This is rsult is u to lonzo Church (1903 1995) an J. arkly Rossr (1907 1989) an is
More informationWeek 3: Connected Subgraphs
Wk 3: Connctd Subgraphs Sptmbr 19, 2016 1 Connctd Graphs Path, Distanc: A path from a vrtx x to a vrtx y in a graph G is rfrrd to an xy-path. Lt X, Y V (G). An (X, Y )-path is an xy-path with x X and y
More information10. EXTENDING TRACTABILITY
Coping with NP-compltnss 0. EXTENDING TRACTABILITY ining small vrtx covrs solving NP-har problms on trs circular arc covrings vrtx covr in bipartit graphs Q. Suppos I n to solv an NP-complt problm. What
More informationTrigonometric functions
Robrto s Nots on Diffrntial Calculus Captr 5: Drivativs of transcndntal functions Sction 5 Drivativs of Trigonomtric functions Wat you nd to know alrady: Basic trigonomtric limits, t dfinition of drivativ,
More informationOnline Supplement: Advance Selling in a Supply Chain under Uncertain Supply and Demand
Onlin Supplmnt Avanc Slling in a Supply Cain unr Uncrtain Supply an Dman. Proos o Analytical sults Proo o Lmma. Using a = minl 0 ; x g; w can rwrit () as ollows (x ; w ; x ; w ) = a +(m0 w )a +( +" x w
More informationCombinatorial Networks Week 1, March 11-12
1 Nots on March 11 Combinatorial Ntwors W 1, March 11-1 11 Th Pigonhol Principl Th Pigonhol Principl If n objcts ar placd in hols, whr n >, thr xists a box with mor than on objcts 11 Thorm Givn a simpl
More informationEdge-Triggered D Flip-flop. Formal Analysis. Fundamental-Mode Sequential Circuits. D latch: How do flip-flops work?
E-Trir D Flip-Flop Funamntal-Mo Squntial Ciruits PR A How o lip-lops work? How to analys aviour o lip-lops? R How to sin unamntal-mo iruits? Funamntal mo rstrition - only on input an an at a tim; iruit
More informationAP Calculus Multiple-Choice Question Collection
AP Calculus Multipl-Coic Qustion Collction 985 998 . f is a continuous function dfind for all ral numbrs and if t maimum valu of f () is 5 and t minimum valu of f () is 7, tn wic of t following must b
More informationFinal Exam Solutions
CS 2 Advancd Data Structurs and Algorithms Final Exam Solutions Jonathan Turnr /8/20. (0 points) Suppos that r is a root of som tr in a Fionacci hap. Assum that just for a dltmin opration, r has no childrn
More information1 Minimum Cut Problem
CS 6 Lctur 6 Min Cut and argr s Algorithm Scribs: Png Hui How (05), Virginia Dat: May 4, 06 Minimum Cut Problm Today, w introduc th minimum cut problm. This problm has many motivations, on of which coms
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 informationENGR 7181 LECTURE NOTES WEEK 3 Dr. Amir G. Aghdam Concordia University
ENGR 78 LECTURE NOTES WEEK Dr. ir G. ga Concoria Univrity DT Equivalnt Tranfr Function for SSO Syt - So far w av tui DT quivalnt tat pac ol uing tp-invariant tranforation. n t ca of SSO yt on can u t following
More informationAnalysis of Algorithms - Elementary graphs algorithms -
Analysis of Algorithms - Elmntary graphs algorithms - Anras Ermahl MRTC (Mälaralns Ral-Tim Rsach Cntr) anras.rmahl@mh.s Autumn 00 Graphs Graphs ar important mathmatical ntitis in computr scinc an nginring
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 informationpriority queue ADT heaps 1
COMP 250 Lctur 23 priority quu ADT haps 1 Nov. 1/2, 2017 1 Priority Quu Li a quu, but now w hav a mor gnral dinition o which lmnt to rmov nxt, namly th on with highst priority..g. hospital mrgncy room
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 informationInternet Algorithms. (Oblivious) Routing. Lecture 10 06/24/11. Wereferto. demands(requirements), forall vertex pairs,,
Intrnt Algoritms Ltur 10 06/24/11 (Olivious) Routing Givn a ntwork, witdglngtsl and dmands(rquirmnts), forall vrtx pairs,, afasilroutingisa multiommodityflow, satisfying t rquirmnts, i..,,,,, Wrfrto,,,,,
More informationAdditional Math (4047) Paper 2 (100 marks) y x. 2 d. d d
Aitional Math (07) Prpar b Mr Ang, Nov 07 Fin th valu of th constant k for which is a solution of th quation k. [7] Givn that, Givn that k, Thrfor, k Topic : Papr (00 marks) Tim : hours 0 mins Nam : Aitional
More informationChapter Finding Small Vertex Covers. Extending the Limits of Tractability. Coping With NP-Completeness. Vertex Cover
Coping With NP-Compltnss Chaptr 0 Extning th Limits o Tractability Q. Suppos I n to solv an NP-complt problm. What shoul I o? A. Thory says you'r unlikly to in poly-tim algorithm. Must sacriic on o thr
More informationAnalysis of Algorithms - Elementary graphs algorithms -
Analysis of Algorithms - Elmntary graphs algorithms - Anras Ermahl MRTC (Mälaralns Ral-Tim Rsarch Cntr) anras.rmahl@mh.s Autumn 004 Graphs Graphs ar important mathmatical ntitis in computr scinc an nginring
More informationThe Matrix Exponential
Th Matrix Exponntial (with xrciss) by D. Klain Vrsion 207.0.05 Corrctions and commnts ar wlcom. Th Matrix Exponntial For ach n n complx matrix A, dfin th xponntial of A to b th matrix A A k I + A + k!
More informationAP Calculus BC AP Exam Problems Chapters 1 3
AP Eam Problms Captrs Prcalculus Rviw. If f is a continuous function dfind for all ral numbrs and if t maimum valu of f() is 5 and t minimum valu of f() is 7, tn wic of t following must b tru? I. T maimum
More informationCPS 616 W2017 MIDTERM SOLUTIONS 1
CPS 616 W2017 MIDTERM SOLUTIONS 1 PART 1 20 MARKS - MULTIPLE CHOICE Instructions Plas ntr your answrs on t bubbl st wit your nam unlss you ar writin tis xam at t Tst Cntr, in wic cas you sould just circl
More informationThe Matrix Exponential
Th Matrix Exponntial (with xrciss) by Dan Klain Vrsion 28928 Corrctions and commnts ar wlcom Th Matrix Exponntial For ach n n complx matrix A, dfin th xponntial of A to b th matrix () A A k I + A + k!
More informationExponential Functions
Eponntial Functions Dinition: An Eponntial Function is an unction tat as t orm a, wr a > 0. T numbr a is calld t bas. Eampl: Lt i.. at intgrs. It is clar wat t unction mans or som valus o. 0 0,,, 8,,.,.
More informationUniversity of Washington Department of Chemistry Chemistry 453 Winter Quarter 2014 Lecture 20: Transition State Theory. ERD: 25.14
Univrsity of Wasinton Dpartmnt of Cmistry Cmistry 453 Wintr Quartr 04 Lctur 0: Transition Stat Tory. ERD: 5.4. Transition Stat Tory Transition Stat Tory (TST) or ctivatd Complx Tory (CT) is a raction mcanism
More informationPhysics 43 HW #9 Chapter 40 Key
Pysics 43 HW #9 Captr 4 Ky Captr 4 1 Aftr many ours of dilignt rsarc, you obtain t following data on t potolctric ffct for a crtain matrial: Wavlngt of Ligt (nm) Stopping Potntial (V) 36 3 4 14 31 a) Plot
More information3-2-1 ANN Architecture
ARTIFICIAL NEURAL NETWORKS (ANNs) Profssor Tom Fomby Dpartmnt of Economics Soutrn Mtodist Univrsity Marc 008 Artificial Nural Ntworks (raftr ANNs) can b usd for itr prdiction or classification problms.
More informationThe Transfer Function. The Transfer Function. The Transfer Function. The Transfer Function. The Transfer Function. The Transfer Function
A gnraliation of th frquncy rsons function Th convolution sum scrition of an LTI iscrt-tim systm with an imuls rsons h[n] is givn by h y [ n] [ ] x[ n ] Taing th -transforms of both sis w gt n n h n n
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 informationSteinberg 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
More informationCS 491 G Combinatorial Optimization
CS 49 G Cobinatorial Optiization Lctur Nots Junhui Jia. Maiu Flow Probls Now lt us iscuss or tails on aiu low probls. Thor. A asibl low is aiu i an only i thr is no -augnting path. Proo: Lt P = A asibl
More informationMultiple Short Term Infusion Homework # 5 PHA 5127
Multipl Short rm Infusion Homwork # 5 PHA 527 A rug is aministr as a short trm infusion. h avrag pharmacokintic paramtrs for this rug ar: k 0.40 hr - V 28 L his rug follows a on-compartmnt boy mol. A 300
More informationIntroduction to Arithmetic Geometry Fall 2013 Lecture #20 11/14/2013
18.782 Introduction to Arithmtic Gomtry Fall 2013 Lctur #20 11/14/2013 20.1 Dgr thorm for morphisms of curvs Lt us rstat th thorm givn at th nd of th last lctur, which w will now prov. Thorm 20.1. Lt φ:
More informationSearching Linked Lists. Perfect Skip List. Building a Skip List. Skip List Analysis (1) Assume the list is sorted, but is stored in a linked list.
3 3 4 8 6 3 3 4 8 6 3 3 4 8 6 () (d) 3 Sarching Linkd Lists Sarching Linkd Lists Sarching Linkd Lists ssum th list is sortd, but is stord in a linkd list. an w us binary sarch? omparisons? Work? What if
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 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 informationRecall that by Theorems 10.3 and 10.4 together provide us the estimate o(n2 ), S(q) q 9, q=1
Chaptr 11 Th singular sris Rcall that by Thorms 10 and 104 togthr provid us th stimat 9 4 n 2 111 Rn = SnΓ 2 + on2, whr th singular sris Sn was dfind in Chaptr 10 as Sn = q=1 Sq q 9, with Sq = 1 a q gcda,q=1
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 informationON RIGHT(LEFT) DUO PO-SEMIGROUPS. S. K. Lee and K. Y. Park
Kangwon-Kyungki Math. Jour. 11 (2003), No. 2, pp. 147 153 ON RIGHT(LEFT) DUO PO-SEMIGROUPS S. K. L and K. Y. Park Abstract. W invstigat som proprtis on right(rsp. lft) duo po-smigroups. 1. Introduction
More informationDerangements and Applications
2 3 47 6 23 Journal of Intgr Squncs, Vol. 6 (2003), Articl 03..2 Drangmnts and Applications Mhdi Hassani Dpartmnt of Mathmatics Institut for Advancd Studis in Basic Scincs Zanjan, Iran mhassani@iasbs.ac.ir
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 informationSection 6.1. Question: 2. Let H be a subgroup of a group G. Then H operates on G by left multiplication. Describe the orbits for this operation.
MAT 444 H Barclo Spring 004 Homwork 6 Solutions Sction 6 Lt H b a subgroup of a group G Thn H oprats on G by lft multiplication Dscrib th orbits for this opration Th orbits of G ar th right costs of H
More informationENGR 7181 LECTURE NOTES WEEK 5 Dr. Amir G. Aghdam Concordia University
ENGR 78 LETURE NOTES WEEK 5 r. mir G. dam onordia Univrity ilinar Tranformation - W will now introdu anotr mtod of tranformation from -plan to t - plan and vi vra. - Ti tranformation i bad on t trapoidal
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 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 informationPropositional Logic. Combinatorial Problem Solving (CPS) Albert Oliveras Enric Rodríguez-Carbonell. May 17, 2018
Propositional Logic Combinatorial Problm Solving (CPS) Albrt Olivras Enric Rodríguz-Carbonll May 17, 2018 Ovrviw of th sssion Dfinition of Propositional Logic Gnral Concpts in Logic Rduction to SAT CNFs
More informationCS553 Lecture Register Allocation I 3
Low-Lvl Issus Last ltur Intrproural analysis Toay Start low-lvl issus Rgistr alloation Latr Mor rgistr alloation Instrution shuling CS553 Ltur Rgistr Alloation I 2 Rgistr Alloation Prolm Assign an unoun
More information(Upside-Down o Direct Rotation) β - Numbers
Amrican Journal of Mathmatics and Statistics 014, 4(): 58-64 DOI: 10593/jajms0140400 (Upsid-Down o Dirct Rotation) β - Numbrs Ammar Sddiq Mahmood 1, Shukriyah Sabir Ali,* 1 Dpartmnt of Mathmatics, Collg
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 informationOn spanning trees and cycles of multicolored point sets with few intersections
On spanning trs and cycls of multicolord point sts with fw intrsctions M. Kano, C. Mrino, and J. Urrutia April, 00 Abstract Lt P 1,..., P k b a collction of disjoint point sts in R in gnral position. W
More informationa 1and x is any real number.
Calcls Nots Eponnts an Logarithms Eponntial Fnction: Has th form y a, whr a 0, a an is any ral nmbr. Graph y, Graph y ln y y Th Natral Bas (Elr s nmbr): An irrational nmbr, symboliz by th lttr, appars
More informationCase Study 1 PHA 5127 Fall 2006 Revised 9/19/06
Cas Study Qustion. A 3 yar old, 5 kg patint was brougt in for surgry and was givn a /kg iv bolus injction of a muscl rlaxant. T plasma concntrations wr masurd post injction and notd in t tabl blow: Tim
More informationY 0. Standing Wave Interference between the incident & reflected waves Standing wave. A string with one end fixed on a wall
Staning Wav Intrfrnc btwn th incint & rflct wavs Staning wav A string with on n fix on a wall Incint: y, t) Y cos( t ) 1( Y 1 ( ) Y (St th incint wav s phas to b, i.., Y + ral & positiv.) Rflct: y, t)
More informationRecounting the Rationals
Rconting th Rationals Nil Calkin and Hrbrt S. Wilf pril, 000 It is wll known (indd, as Pal Erd}os might hav said, vry child knows) that th rationals ar contabl. Howvr, th standard prsntations of this fact
More informationMathematics 1110H Calculus I: Limits, derivatives, and Integrals Trent University, Summer 2018 Solutions to the Actual Final Examination
Mathmatics H Calculus I: Limits, rivativs, an Intgrals Trnt Univrsity, Summr 8 Solutions to th Actual Final Eamination Tim-spac: 9:-: in FPHL 7. Brought to you by Stfan B lan k. Instructions: Do parts
More informationBINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES
BINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES DONALD M. DAVIS Abstract. If p is a prim (implicit in notation and n a positiv intgr, lt ν(n dnot th xponnt of p in n, and U(n n/p ν(n, th unit
More informationf(x + h) f(x) f (x) = lim
Introuction 4.3 Some Very Basic Differentiation Formulas If a ifferentiable function f is quite simple, ten it is possible to fin f by using te efinition of erivative irectly: f () 0 f( + ) f() However,
More informationMAT 270 Test 3 Review (Spring 2012) Test on April 11 in PSA 21 Section 3.7 Implicit Derivative
MAT 7 Tst Rviw (Spring ) Tst on April in PSA Sction.7 Implicit Drivativ Rmmbr: Equation of t tangnt lin troug t point ( ab, ) aving slop m is y b m( a ). dy Find t drivativ y d. y y. y y y. y 4. y sin(
More informationSPH4U Electric Charges and Electric Fields Mr. LoRusso
SPH4U lctric Chargs an lctric Fils Mr. LoRusso lctricity is th flow of lctric charg. Th Grks first obsrv lctrical forcs whn arly scintists rubb ambr with fur. Th notic thy coul attract small bits of straw
More informationDiscrete Fourier Transform. Discrete Fourier Transform. Discrete Fourier Transform. Discrete Fourier Transform. Discrete Fourier Transform
Discrt Fourir Trasform Dfiitio - T simplst rlatio btw a lt- squc x dfid for ω ad its DTFT X ( ) is ω obtaid by uiformly sampli X ( ) o t ω-axis btw ω < at ω From t dfiitio of t DTFT w tus av X X( ω ) ω
More informationcycle that does not cross any edges (including its own), then it has at least
W prov th following thorm: Thorm If a K n is drawn in th plan in such a way that it has a hamiltonian cycl that dos not cross any dgs (including its own, thn it has at last n ( 4 48 π + O(n crossings Th
More informationAtomic Physics. Final Mon. May 12, 12:25-2:25, Ingraham B10 Get prepared for the Final!
# SCORES 50 40 30 0 10 MTE 3 Rsults P08 Exam 3 0 30 40 50 60 70 80 90 100 SCORE Avrag 79.75/100 std 1.30/100 A 19.9% AB 0.8% B 6.3% BC 17.4% C 13.1% D.1% F 0.4% Final Mon. Ma 1, 1:5-:5, Ingraam B10 Gt
More information64. A Conic Section from Five Elements.
. onic Sction from Fiv Elmnts. To raw a conic sction of which fiv lmnts - points an tangnts - ar known. W consir th thr cass:. Fiv points ar known.. Four points an a tangnt lin ar known.. Thr points an
More informationN1.1 Homework Answers
Camrig Essntials Mathmatis Cor 8 N. Homwork Answrs N. Homwork Answrs a i 6 ii i 0 ii 3 2 Any pairs of numrs whih satisfy th alulation. For xampl a 4 = 3 3 6 3 = 3 4 6 2 2 8 2 3 3 2 8 5 5 20 30 4 a 5 a
More informationFirst order differential equation Linear equation; Method of integrating factors
First orr iffrntial quation Linar quation; Mtho of intgrating factors Exampl 1: Rwrit th lft han si as th rivativ of th prouct of y an som function by prouct rul irctly. Solving th first orr iffrntial
More informationKernels. ffl A kernel K is a function of two objects, for example, two sentence/tree pairs (x1; y1) and (x2; y2)
Krnls krnl K is a function of two ojcts, for xampl, two sntnc/tr pairs (x1; y1) an (x2; y2) K((x1; y1); (x2; y2)) Intuition: K((x1; y1); (x2; y2)) is a masur of th similarity (x1; y1) twn (x2; y2) an ormally:
More information16.unified Introduction to Computers and Programming. SOLUTIONS to Examination 4/30/04 9:05am - 10:00am
16.unii Introution to Computrs n Prormmin SOLUTIONS to Exmintion /30/0 9:05m - 10:00m Pro. I. Kristin Lunqvist Sprin 00 Grin Stion: Qustion 1 (5) Qustion (15) Qustion 3 (10) Qustion (35) Qustion 5 (10)
More informationInternational Journal of Scientific & Engineering Research, Volume 6, Issue 7, July ISSN
Intrnational Journal of Scintific & Enginring Rsarch, Volum 6, Issu 7, July-25 64 ISSN 2229-558 HARATERISTIS OF EDGE UTSET MATRIX OF PETERSON GRAPH WITH ALGEBRAI GRAPH THEORY Dr. G. Nirmala M. Murugan
More informationUnit 6: Solving Exponential Equations and More
Habrman MTH 111 Sction II: Eonntial and Logarithmic Functions Unit 6: Solving Eonntial Equations and Mor EXAMPLE: Solv th quation 10 100 for. Obtain an act solution. This quation is so asy to solv that
More informationRikkert Frederix. Figure 2: As in fig. 1, for the transverse momentum of the 1 st jet.
Z+jts Exclusiv jt multiplicity an arst an 3r arst jt pt spctra Uncrtainty ban contains rn. & fac. scal, PDF & mrging scal pnnc Ratr goo agrmnt btwn ata an tory Figur 1: Exclusiv jt multiplicity. Data from
More informationSchematic of a mixed flow reactor (both advection and dispersion must be accounted for)
Cas stuy 6.1, R: Chapra an Canal, p. 769. Th quation scribin th concntration o any tracr in an lonat ractor is known as th avction-isprsion quation an may b writtn as: Schmatic o a mi low ractor (both
More informationCompton Scattering. There are three related processes. Thomson scattering (classical) Rayleigh scattering (coherent)
Comton Scattring Tr ar tr rlatd rocsss Tomson scattring (classical) Poton-lctron Comton scattring (QED) Poton-lctron Raylig scattring (cornt) Poton-atom Tomson and Raylig scattring ar lasticonly t dirction
More informationCarriers Concentration in Semiconductors - VI. Prof.P. Ravindran, Department of Physics, Central University of Tamil Nadu, India
Carrirs Conntration in Smionutors - VI 1 Prof.P. Ravinran, Dpartmnt of Pysis, Cntral Univrsity of Tamil au, Inia ttp://folk.uio.no/ravi/smi01 P.Ravinran, PHY0 Smionutor Pysis, 17 January 014 : Carrirs
More informationAbstract Interpretation: concrete and abstract semantics
Abstract Intrprtation: concrt and abstract smantics Concrt smantics W considr a vry tiny languag that manags arithmtic oprations on intgrs valus. Th (concrt) smantics of th languags cab b dfind by th funzcion
More informationBasic Polyhedral theory
Basic Polyhdral thory Th st P = { A b} is calld a polyhdron. Lmma 1. Eithr th systm A = b, b 0, 0 has a solution or thr is a vctorπ such that π A 0, πb < 0 Thr cass, if solution in top row dos not ist
More informationCMU Fall VLSI CAD
CMU Fall 00 8-760 VLSI CAD [5 pts] HW 5. Out: Tue Nov 7, Due: Tu. Dec 0, in class. (V). Quadratic Placement [5 pts] Consider tis simple netlist wit fixed pins, wic as placeable objects. All te -point wires
More informationThe tangent line and the velocity problems. The derivative at a point and rates of change. , such as the graph shown below:
Capter 3: Derivatives In tis capter we will cover: 3 Te tanent line an te velocity problems Te erivative at a point an rates o cane 3 Te erivative as a unction Dierentiability 3 Derivatives o constant,
More informationCase Study Vancomycin Answers Provided by Jeffrey Stark, Graduate Student
Cas Stuy Vancomycin Answrs Provi by Jffry Stark, Grauat Stunt h antibiotic Vancomycin is liminat almost ntirly by glomrular filtration. For a patint with normal rnal function, th half-lif is about 6 hours.
More informationOVERFLOW IN A CYLINDRICAL PIPE BEND. 1. Introduction. Fig. 1: Overflow in a cylindrical pipe bend
circular cannl, ovrflow, brink pt, pip bn Dtlf AIGNER; Carstn CHERUBIM Institut of Hyraulic Enginring an Appli Hyromcanics, Drsn Univrsity of Tcnology OVERFLOW IN A CYLINDRICAL PIPE BEND T ovrflow of watr
More informationu x v x dx u x v x v x u x dx d u x v x u x v x dx u x v x dx Integration by Parts Formula
7. Intgration by Parts Each drivativ formula givs ris to a corrsponding intgral formula, as w v sn many tims. Th drivativ product rul yilds a vry usful intgration tchniqu calld intgration by parts. Starting
More informationLecture 37 (Schrödinger Equation) Physics Spring 2018 Douglas Fields
Lctur 37 (Schrödingr Equation) Physics 6-01 Spring 018 Douglas Filds Rducd Mass OK, so th Bohr modl of th atom givs nrgy lvls: E n 1 k m n 4 But, this has on problm it was dvlopd assuming th acclration
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 informationSecurity Constrained Optimal Power Flow
Security Constrained Optimal Power Flow 1. Introduction and notation Fiure 1 below compares te optimal power flow (OPF wit te security-constrained optimal power flow (SCOPF. Fi. 1 Some comments about tese
More information232 Calculus and Structures
3 Calculus and Structures CHAPTER 17 JUSTIFICATION OF THE AREA AND SLOPE METHODS FOR EVALUATING BEAMS Calculus and Structures 33 Copyrigt Capter 17 JUSTIFICATION OF THE AREA AND SLOPE METHODS 17.1 THE
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 informationDeift/Zhou Steepest descent, Part I
Lctur 9 Dift/Zhou Stpst dscnt, Part I W now focus on th cas of orthogonal polynomials for th wight w(x) = NV (x), V (x) = t x2 2 + x4 4. Sinc th wight dpnds on th paramtr N N w will writ π n,n, a n,n,
More informationShortest Paths in Graphs. Paths in graphs. Shortest paths CS 445. Alon Efrat Slides courtesy of Erik Demaine and Carola Wenk
S 445 Shortst Paths n Graphs lon frat Sls courtsy of rk man an arola Wnk Paths n raphs onsr a raph G = (V, ) wth -wht functon w : R. Th wht of path p = v v v k s fn to xampl: k = w ( p) = w( v, v + ).
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 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 informationCPSC 665 : An Algorithmist s Toolkit Lecture 4 : 21 Jan Linear Programming
CPSC 665 : An Algorithmist s Toolkit Lctur 4 : 21 Jan 2015 Lcturr: Sushant Sachdva Linar Programming Scrib: Rasmus Kyng 1. Introduction An optimization problm rquirs us to find th minimum or maximum) of
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 informationk m The reason that his is very useful can be seen by examining the Taylor series expansion of some potential V(x) about a minimum point:
roic Oscilltor Pottil W r ow goig to stuy solutios to t TIS for vry usful ottil tt of t roic oscilltor. I clssicl cics tis is quivlt to t block srig robl or tt of t ulu (for sll oscilltios bot of wic r
More informationLogarithmic functions
Roberto s Notes on Differential Calculus Capter 5: Derivatives of transcendental functions Section Derivatives of Logaritmic functions Wat ou need to know alread: Definition of derivative and all basic
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 informationChapter 10. The singular integral Introducing S(n) and J(n)
Chaptr Th singular intgral Our aim in this chaptr is to rplac th functions S (n) and J (n) by mor convnint xprssions; ths will b calld th singular sris S(n) and th singular intgral J(n). This will b don
More information