lect-optional1 - 1 4 1 4 4 4 4 4 4 4 1 1 1 1 1 1 Chinese...

Info iconThis preview shows pages 1–24. Sign up to view the full content.

View Full Document Right Arrow Icon
Optional Lecture Maximum Weight Matching
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Maximum Weight Matching weight. total maximumis with matching a find , : weight edge positive with ) , ( graph bipartite a Given + = R E w E V G 1 3 ?
Background image of page 2
Minimum Weight Matching weight. toal maximumis with matching a find , : weight edge e nonnegativ with ) , ( graph a Given + = R E c E V G
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Augmenting Path edges. matched on that edges unmatched on weight total with the cycle e alternativ an is cycle augmenting An edges. matched on weight total the edges unmatched on weight total the that, propert path with e alternativ maxinal a is path augmenting An vertex. free a called is matching some in edge an of endpoint not the is hat A vertex t M
Background image of page 4
Optimality Condition . w.r.t. path/cycle augmenting an contains * Then *). ( ) ( with matchings two be * and Let ) ( Trivial. ) ( M M M M c M c M M < M * M * M * M cycle. augmenting no and path augmenting no has it iff weight - maximum is matching A
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Puzzle mple. counterexa a give Please wrong. is material reading in algorithm The 5 5 5 5
Background image of page 6
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 8
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 10
Background image of page 11

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 12
Background image of page 13

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 14
Background image of page 15

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 16
Background image of page 17

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 18
Background image of page 19

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 20
Background image of page 21

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 22
Background image of page 23

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 24
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 1 4 1 4 4 4 4 4 4 4 1 1 1 1 1 1 Chinese Postman 8 9 10 11 12 13 Network G = (N, A) Node set N = {1, 2, 3, 4} Arc Set A = {(1,2), (1,4), (4,2), (4,3), (2,3)} In an undirected graph, (i,j) = (j,i) 14 a a 15 16 17 18 19 20 21 Chinese Postman distance. possible least with the letters, deliver order to in city a in road every along travel to shes Postman wi Chinese The once. least at traversed is edge each in which graph the of walk closed shortest a find weight, edge e nonnegativ graph with a Given Minimum Weight Perfect Matching Minimum Weight Perfect Matching can be transformed to Maximum Weight Matching. Chinese Postman Problem is equivalent to Minimum Weight Perfect Matching in graph on odd nodes....
View Full Document

This note was uploaded on 11/03/2010 for the course COMPUTER S CS 6363 taught by Professor Dingzhudu during the Fall '10 term at University of Texas at Dallas, Richardson.

Page1 / 24

lect-optional1 - 1 4 1 4 4 4 4 4 4 4 1 1 1 1 1 1 Chinese...

This preview shows document pages 1 - 24. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online