1 / 3

Cycles and Paths vs functions

Cycles and Paths vs functions. Cycle c: Take f( v,w ) = 1 if ( v,w ) is an arc on the cycle Take f( v,w ) = 0 otherwise Note: this is a special case of a circulation Path p from s to t : Take f( v,w ) = 1 if ( v,w ) is an arc on the path Take f( v,w ) = 0 otherwise

cosima
Download Presentation

Cycles and Paths vs functions

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Cycles and Paths vs functions • Cycle c: • Take f(v,w) = 1if (v,w) is an arc on the cycle • Take f(v,w) = 0 otherwise • Note: this is a special case of a circulation • Path p from s to t: • Take f(v,w) = 1if (v,w) is an arc on the path • Take f(v,w) = 0 otherwise • Note: this is a special case of a flow from s to t with value 1

  2. A useful theorem on circulations • Theorem Let f be a circulation. Then f is a nonnegative linear combination of cycles in G. • Proof. Find a cycle c, with minimum flow on c r, and use induction with f – r * c. • Note: each step we have at least one additional arc (v,w) with f(v,w) = 0 • If f is integer, `integer scalared’ linear combination.

  3. Corollary on flows • Theorem Let f be a flow from s to t. f can be written as a linear combination of cycles and paths from s to t. • Look at the circulation by adding an edge from t to s and giving it flow value(f). Then apply the previous result. • If f is an integer flow, then f can be written as a linear combination of cycles and paths from s to t with each factor an integer.

More Related