SlideShare a Scribd company logo
1 of 3
G REEDY-M ATCHING 1 (G)
                  M ←∅
                  while E(G) = ∅
                (*)    pick the lexicographically first e ∈ E(G)
                       M ← M ∪ {e}
                       remove e and all
                             edges adjacent to e
                             from E(G)
                  return M

Assume the edges in the given graph are ordered pairs (i.e. put a
top-down direction on them).

E(G) = {(1, 6), (1, 9), (1, 10), (2, 7), (2, 8), (2, 9), (2, 10), (3, 7), (3, 8), (4, 6), (4, 7), (4, 8), (5, 6)}



                                                2
The Hungarian algorithm
We will start today’s lecture by running through an example. Consider the
graph below. We will compare the results of G REEDY-M ATCHING 1 with
those of H UNGARIAN -M ATCHING.
                        1     2     3      4    5




                      10     9     8     7      6
You are warmly invited to try this at home with paper and pencil first.




                                    1
1    2   3       4   5




10   9   8       7   6

             4

More Related Content

What's hot

Connectivity of graphs
Connectivity of graphsConnectivity of graphs
Connectivity of graphssana younas
 
Graph theory and life
Graph theory and lifeGraph theory and life
Graph theory and lifeMilan Joshi
 
Attributed Graph Matching of Planar Graphs
Attributed Graph Matching of Planar GraphsAttributed Graph Matching of Planar Graphs
Attributed Graph Matching of Planar GraphsRaül Arlàndez
 
Math350 hw2solutions
Math350 hw2solutionsMath350 hw2solutions
Math350 hw2solutionsPraveen Kumar
 
Darmon Points in mixed signature
Darmon Points in mixed signatureDarmon Points in mixed signature
Darmon Points in mixed signaturemmasdeu
 
Darmon Points for fields of mixed signature
Darmon Points for fields of mixed signatureDarmon Points for fields of mixed signature
Darmon Points for fields of mixed signaturemmasdeu
 
On the Adjacency Matrix and Neighborhood Associated with Zero-divisor Graph f...
On the Adjacency Matrix and Neighborhood Associated with Zero-divisor Graph f...On the Adjacency Matrix and Neighborhood Associated with Zero-divisor Graph f...
On the Adjacency Matrix and Neighborhood Associated with Zero-divisor Graph f...Editor IJCATR
 
deformations of smooth functions on 2-torus whose kronrod-reeb graph is a tree
deformations of smooth functions on 2-torus whose kronrod-reeb graph is a treedeformations of smooth functions on 2-torus whose kronrod-reeb graph is a tree
deformations of smooth functions on 2-torus whose kronrod-reeb graph is a treeBohdan Feshchenko
 
SUPER MAGIC CORONATIONS OF GRAPHS
SUPER MAGIC CORONATIONS OF GRAPHS SUPER MAGIC CORONATIONS OF GRAPHS
SUPER MAGIC CORONATIONS OF GRAPHS IAEME Publication
 
International Journal of Computational Engineering Research(IJCER)
International Journal of Computational Engineering Research(IJCER)International Journal of Computational Engineering Research(IJCER)
International Journal of Computational Engineering Research(IJCER)ijceronline
 
Some Classes of Cubic Harmonious Graphs
Some Classes of Cubic Harmonious GraphsSome Classes of Cubic Harmonious Graphs
Some Classes of Cubic Harmonious Graphsrahulmonikasharma
 

What's hot (20)

Wythoff construction and l1-embedding
Wythoff construction and l1-embeddingWythoff construction and l1-embedding
Wythoff construction and l1-embedding
 
Connectivity of graphs
Connectivity of graphsConnectivity of graphs
Connectivity of graphs
 
1452 86301000013 m
1452 86301000013 m1452 86301000013 m
1452 86301000013 m
 
Graph theory and life
Graph theory and lifeGraph theory and life
Graph theory and life
 
Attributed Graph Matching of Planar Graphs
Attributed Graph Matching of Planar GraphsAttributed Graph Matching of Planar Graphs
Attributed Graph Matching of Planar Graphs
 
Planar graph
Planar graphPlanar graph
Planar graph
 
Math350 hw2solutions
Math350 hw2solutionsMath350 hw2solutions
Math350 hw2solutions
 
Ji2416271633
Ji2416271633Ji2416271633
Ji2416271633
 
Darmon Points in mixed signature
Darmon Points in mixed signatureDarmon Points in mixed signature
Darmon Points in mixed signature
 
Darmon Points for fields of mixed signature
Darmon Points for fields of mixed signatureDarmon Points for fields of mixed signature
Darmon Points for fields of mixed signature
 
On the Adjacency Matrix and Neighborhood Associated with Zero-divisor Graph f...
On the Adjacency Matrix and Neighborhood Associated with Zero-divisor Graph f...On the Adjacency Matrix and Neighborhood Associated with Zero-divisor Graph f...
On the Adjacency Matrix and Neighborhood Associated with Zero-divisor Graph f...
 
deformations of smooth functions on 2-torus whose kronrod-reeb graph is a tree
deformations of smooth functions on 2-torus whose kronrod-reeb graph is a treedeformations of smooth functions on 2-torus whose kronrod-reeb graph is a tree
deformations of smooth functions on 2-torus whose kronrod-reeb graph is a tree
 
Seminar Sample
Seminar SampleSeminar Sample
Seminar Sample
 
SUPER MAGIC CORONATIONS OF GRAPHS
SUPER MAGIC CORONATIONS OF GRAPHS SUPER MAGIC CORONATIONS OF GRAPHS
SUPER MAGIC CORONATIONS OF GRAPHS
 
3D Geometry QA 11
3D Geometry QA 113D Geometry QA 11
3D Geometry QA 11
 
International Journal of Computational Engineering Research(IJCER)
International Journal of Computational Engineering Research(IJCER)International Journal of Computational Engineering Research(IJCER)
International Journal of Computational Engineering Research(IJCER)
 
Notes 3-2
Notes 3-2Notes 3-2
Notes 3-2
 
Aj26225229
Aj26225229Aj26225229
Aj26225229
 
Some Classes of Cubic Harmonious Graphs
Some Classes of Cubic Harmonious GraphsSome Classes of Cubic Harmonious Graphs
Some Classes of Cubic Harmonious Graphs
 
Graphs
GraphsGraphs
Graphs
 

Viewers also liked

Basquesse AW1516 -SS 16 Capsule Look Book
Basquesse AW1516 -SS 16 Capsule Look BookBasquesse AW1516 -SS 16 Capsule Look Book
Basquesse AW1516 -SS 16 Capsule Look BookViviana Pannell
 
Riedell juice quad roller skates
Riedell juice quad roller skatesRiedell juice quad roller skates
Riedell juice quad roller skatesRenjithk
 
Pesquisa Cartier-Bresson
Pesquisa Cartier-BressonPesquisa Cartier-Bresson
Pesquisa Cartier-Bressonguest17aec8
 
New apresentação do microsoft power point
New apresentação do microsoft power pointNew apresentação do microsoft power point
New apresentação do microsoft power pointSyazwan Zuhaizi
 
Implementasi ketatausahaan kelas dan fungsi guru di SDN Dinoyo 3 Malang dan S...
Implementasi ketatausahaan kelas dan fungsi guru di SDN Dinoyo 3 Malang dan S...Implementasi ketatausahaan kelas dan fungsi guru di SDN Dinoyo 3 Malang dan S...
Implementasi ketatausahaan kelas dan fungsi guru di SDN Dinoyo 3 Malang dan S...Nastiti Rahajeng
 
Le PMI possono ancora fare a meno dei social media?
Le PMI possono ancora fare a meno dei social media?Le PMI possono ancora fare a meno dei social media?
Le PMI possono ancora fare a meno dei social media?Social Media Easy
 
Seguridad informática
Seguridad informáticaSeguridad informática
Seguridad informáticaXiomaraApolo
 
The ideal online course
The ideal online course The ideal online course
The ideal online course Telma Martins
 
สไลด์ ประเพณีพื้นเมืองภาคตะวันออกเฉียงเหนือ ป.4+474+dltvsocp4+55t2soc p04 f1...
สไลด์  ประเพณีพื้นเมืองภาคตะวันออกเฉียงเหนือ ป.4+474+dltvsocp4+55t2soc p04 f1...สไลด์  ประเพณีพื้นเมืองภาคตะวันออกเฉียงเหนือ ป.4+474+dltvsocp4+55t2soc p04 f1...
สไลด์ ประเพณีพื้นเมืองภาคตะวันออกเฉียงเหนือ ป.4+474+dltvsocp4+55t2soc p04 f1...Prachoom Rangkasikorn
 
Legal & General
Legal & GeneralLegal & General
Legal & GeneralLevi Evans
 
Mercado de trabalho de TI - Set 2008
Mercado de trabalho de TI - Set 2008Mercado de trabalho de TI - Set 2008
Mercado de trabalho de TI - Set 2008Flávio Teixeira, PMP
 

Viewers also liked (20)

Basquesse AW1516 -SS 16 Capsule Look Book
Basquesse AW1516 -SS 16 Capsule Look BookBasquesse AW1516 -SS 16 Capsule Look Book
Basquesse AW1516 -SS 16 Capsule Look Book
 
Riedell juice quad roller skates
Riedell juice quad roller skatesRiedell juice quad roller skates
Riedell juice quad roller skates
 
rectas
rectasrectas
rectas
 
Pesquisa Cartier-Bresson
Pesquisa Cartier-BressonPesquisa Cartier-Bresson
Pesquisa Cartier-Bresson
 
New apresentação do microsoft power point
New apresentação do microsoft power pointNew apresentação do microsoft power point
New apresentação do microsoft power point
 
Vagalumes
VagalumesVagalumes
Vagalumes
 
Implementasi ketatausahaan kelas dan fungsi guru di SDN Dinoyo 3 Malang dan S...
Implementasi ketatausahaan kelas dan fungsi guru di SDN Dinoyo 3 Malang dan S...Implementasi ketatausahaan kelas dan fungsi guru di SDN Dinoyo 3 Malang dan S...
Implementasi ketatausahaan kelas dan fungsi guru di SDN Dinoyo 3 Malang dan S...
 
Cafés - IAC
Cafés - IACCafés - IAC
Cafés - IAC
 
Le PMI possono ancora fare a meno dei social media?
Le PMI possono ancora fare a meno dei social media?Le PMI possono ancora fare a meno dei social media?
Le PMI possono ancora fare a meno dei social media?
 
Seguridad informática
Seguridad informáticaSeguridad informática
Seguridad informática
 
Soledad Villarreal
Soledad Villarreal
Soledad Villarreal
Soledad Villarreal
 
FPI 150P
FPI 150PFPI 150P
FPI 150P
 
Direccion
DireccionDireccion
Direccion
 
My Degree
My DegreeMy Degree
My Degree
 
The ideal online course
The ideal online course The ideal online course
The ideal online course
 
Il Mondo
Il MondoIl Mondo
Il Mondo
 
สไลด์ ประเพณีพื้นเมืองภาคตะวันออกเฉียงเหนือ ป.4+474+dltvsocp4+55t2soc p04 f1...
สไลด์  ประเพณีพื้นเมืองภาคตะวันออกเฉียงเหนือ ป.4+474+dltvsocp4+55t2soc p04 f1...สไลด์  ประเพณีพื้นเมืองภาคตะวันออกเฉียงเหนือ ป.4+474+dltvsocp4+55t2soc p04 f1...
สไลด์ ประเพณีพื้นเมืองภาคตะวันออกเฉียงเหนือ ป.4+474+dltvsocp4+55t2soc p04 f1...
 
Docx
DocxDocx
Docx
 
Legal & General
Legal & GeneralLegal & General
Legal & General
 
Mercado de trabalho de TI - Set 2008
Mercado de trabalho de TI - Set 2008Mercado de trabalho de TI - Set 2008
Mercado de trabalho de TI - Set 2008
 

Similar to Lingerie Shoot

Conditional Matching Preclusion Number of Certain Graphs
Conditional Matching Preclusion Number of Certain GraphsConditional Matching Preclusion Number of Certain Graphs
Conditional Matching Preclusion Number of Certain GraphsMangaiK4
 
Elements of Graph Theory for IS.pptx
Elements of Graph Theory for IS.pptxElements of Graph Theory for IS.pptx
Elements of Graph Theory for IS.pptxmiki304759
 
THE RESULT FOR THE GRUNDY NUMBER ON P4- CLASSES
THE RESULT FOR THE GRUNDY NUMBER ON P4- CLASSESTHE RESULT FOR THE GRUNDY NUMBER ON P4- CLASSES
THE RESULT FOR THE GRUNDY NUMBER ON P4- CLASSESgraphhoc
 
Graph Dynamical System on Graph Colouring
Graph Dynamical System on Graph ColouringGraph Dynamical System on Graph Colouring
Graph Dynamical System on Graph ColouringClyde Shen
 
Let G be a graph, which may also contain loops and multiple edges. L.pdf
Let G be a graph, which may also contain loops and multiple edges. L.pdfLet G be a graph, which may also contain loops and multiple edges. L.pdf
Let G be a graph, which may also contain loops and multiple edges. L.pdffedosys
 
Maximizing a Nonnegative, Monotone, Submodular Function Constrained to Matchings
Maximizing a Nonnegative, Monotone, Submodular Function Constrained to MatchingsMaximizing a Nonnegative, Monotone, Submodular Function Constrained to Matchings
Maximizing a Nonnegative, Monotone, Submodular Function Constrained to Matchingssagark4
 
On algorithmic problems concerning graphs of higher degree of symmetry
On algorithmic problems concerning graphs of higher degree of symmetryOn algorithmic problems concerning graphs of higher degree of symmetry
On algorithmic problems concerning graphs of higher degree of symmetrygraphhoc
 
Problem Solving by Computer Finite Element Method
Problem Solving by Computer Finite Element MethodProblem Solving by Computer Finite Element Method
Problem Solving by Computer Finite Element MethodPeter Herbert
 
ON ALGORITHMIC PROBLEMS CONCERNING GRAPHS OF HIGHER DEGREE OF SYMMETRY
ON ALGORITHMIC PROBLEMS CONCERNING GRAPHS OF HIGHER DEGREE OF SYMMETRYON ALGORITHMIC PROBLEMS CONCERNING GRAPHS OF HIGHER DEGREE OF SYMMETRY
ON ALGORITHMIC PROBLEMS CONCERNING GRAPHS OF HIGHER DEGREE OF SYMMETRYFransiskeran
 
Cs6702 graph theory and applications Anna University question paper apr may 2...
Cs6702 graph theory and applications Anna University question paper apr may 2...Cs6702 graph theory and applications Anna University question paper apr may 2...
Cs6702 graph theory and applications Anna University question paper apr may 2...appasami
 

Similar to Lingerie Shoot (20)

Rv2
Rv2Rv2
Rv2
 
10.1.1.226.4381
10.1.1.226.438110.1.1.226.4381
10.1.1.226.4381
 
Isograph
IsographIsograph
Isograph
 
Conditional Matching Preclusion Number of Certain Graphs
Conditional Matching Preclusion Number of Certain GraphsConditional Matching Preclusion Number of Certain Graphs
Conditional Matching Preclusion Number of Certain Graphs
 
Elements of Graph Theory for IS.pptx
Elements of Graph Theory for IS.pptxElements of Graph Theory for IS.pptx
Elements of Graph Theory for IS.pptx
 
THE RESULT FOR THE GRUNDY NUMBER ON P4- CLASSES
THE RESULT FOR THE GRUNDY NUMBER ON P4- CLASSESTHE RESULT FOR THE GRUNDY NUMBER ON P4- CLASSES
THE RESULT FOR THE GRUNDY NUMBER ON P4- CLASSES
 
Graph theory
Graph theoryGraph theory
Graph theory
 
Graph Dynamical System on Graph Colouring
Graph Dynamical System on Graph ColouringGraph Dynamical System on Graph Colouring
Graph Dynamical System on Graph Colouring
 
Graph ds
Graph dsGraph ds
Graph ds
 
FDP-libre(1)
FDP-libre(1)FDP-libre(1)
FDP-libre(1)
 
graph theory
graph theorygraph theory
graph theory
 
Let G be a graph, which may also contain loops and multiple edges. L.pdf
Let G be a graph, which may also contain loops and multiple edges. L.pdfLet G be a graph, which may also contain loops and multiple edges. L.pdf
Let G be a graph, which may also contain loops and multiple edges. L.pdf
 
graph_theory_ch_3_20201124.ppt
graph_theory_ch_3_20201124.pptgraph_theory_ch_3_20201124.ppt
graph_theory_ch_3_20201124.ppt
 
MMath
MMathMMath
MMath
 
Maximizing a Nonnegative, Monotone, Submodular Function Constrained to Matchings
Maximizing a Nonnegative, Monotone, Submodular Function Constrained to MatchingsMaximizing a Nonnegative, Monotone, Submodular Function Constrained to Matchings
Maximizing a Nonnegative, Monotone, Submodular Function Constrained to Matchings
 
On algorithmic problems concerning graphs of higher degree of symmetry
On algorithmic problems concerning graphs of higher degree of symmetryOn algorithmic problems concerning graphs of higher degree of symmetry
On algorithmic problems concerning graphs of higher degree of symmetry
 
Merrk
MerrkMerrk
Merrk
 
Problem Solving by Computer Finite Element Method
Problem Solving by Computer Finite Element MethodProblem Solving by Computer Finite Element Method
Problem Solving by Computer Finite Element Method
 
ON ALGORITHMIC PROBLEMS CONCERNING GRAPHS OF HIGHER DEGREE OF SYMMETRY
ON ALGORITHMIC PROBLEMS CONCERNING GRAPHS OF HIGHER DEGREE OF SYMMETRYON ALGORITHMIC PROBLEMS CONCERNING GRAPHS OF HIGHER DEGREE OF SYMMETRY
ON ALGORITHMIC PROBLEMS CONCERNING GRAPHS OF HIGHER DEGREE OF SYMMETRY
 
Cs6702 graph theory and applications Anna University question paper apr may 2...
Cs6702 graph theory and applications Anna University question paper apr may 2...Cs6702 graph theory and applications Anna University question paper apr may 2...
Cs6702 graph theory and applications Anna University question paper apr may 2...
 

More from christina bres

More from christina bres (7)

Product Portfolio
Product PortfolioProduct Portfolio
Product Portfolio
 
Organic Farming Campaign
Organic Farming CampaignOrganic Farming Campaign
Organic Farming Campaign
 
Seventeen Magazine - Rich's
Seventeen Magazine - Rich'sSeventeen Magazine - Rich's
Seventeen Magazine - Rich's
 
Store Signage - Macy's
Store Signage - Macy'sStore Signage - Macy's
Store Signage - Macy's
 
Shoe Sale Postcard
Shoe Sale PostcardShoe Sale Postcard
Shoe Sale Postcard
 
Investment Campaign
Investment CampaignInvestment Campaign
Investment Campaign
 
Golf Catalog
Golf CatalogGolf Catalog
Golf Catalog
 

Recently uploaded

Oι πιο ευτυχισμένες και οι πιο δυστυχισμένες χώρες: Πρωτιά για τη Φινλανδία -...
Oι πιο ευτυχισμένες και οι πιο δυστυχισμένες χώρες: Πρωτιά για τη Φινλανδία -...Oι πιο ευτυχισμένες και οι πιο δυστυχισμένες χώρες: Πρωτιά για τη Φινλανδία -...
Oι πιο ευτυχισμένες και οι πιο δυστυχισμένες χώρες: Πρωτιά για τη Φινλανδία -...Newsroom8
 
Boys Wholesale Clothing Online | Port 213
Boys Wholesale Clothing Online | Port 213Boys Wholesale Clothing Online | Port 213
Boys Wholesale Clothing Online | Port 213Port 213
 
Secrets for A Happy Relationship & Marriage.
Secrets for A Happy Relationship & Marriage.Secrets for A Happy Relationship & Marriage.
Secrets for A Happy Relationship & Marriage.Surajkurrey
 
The Heirloom Gown: A Tale of Love and Legacy
The Heirloom Gown: A Tale of Love and LegacyThe Heirloom Gown: A Tale of Love and Legacy
The Heirloom Gown: A Tale of Love and Legacyirumsohale
 
Alex Gurkin: Strategies for a Sustainable Tech Career
Alex Gurkin: Strategies for a Sustainable Tech CareerAlex Gurkin: Strategies for a Sustainable Tech Career
Alex Gurkin: Strategies for a Sustainable Tech CareerAlex Gurkin
 
HVAC Replacement Process for Commercial Buildings Guide
HVAC Replacement Process for Commercial Buildings GuideHVAC Replacement Process for Commercial Buildings Guide
HVAC Replacement Process for Commercial Buildings Guideoutreachacdirect
 
Beyond Academics - Anibal Romero .pdf
Beyond Academics - Anibal Romero    .pdfBeyond Academics - Anibal Romero    .pdf
Beyond Academics - Anibal Romero .pdfroberttianibal
 

Recently uploaded (7)

Oι πιο ευτυχισμένες και οι πιο δυστυχισμένες χώρες: Πρωτιά για τη Φινλανδία -...
Oι πιο ευτυχισμένες και οι πιο δυστυχισμένες χώρες: Πρωτιά για τη Φινλανδία -...Oι πιο ευτυχισμένες και οι πιο δυστυχισμένες χώρες: Πρωτιά για τη Φινλανδία -...
Oι πιο ευτυχισμένες και οι πιο δυστυχισμένες χώρες: Πρωτιά για τη Φινλανδία -...
 
Boys Wholesale Clothing Online | Port 213
Boys Wholesale Clothing Online | Port 213Boys Wholesale Clothing Online | Port 213
Boys Wholesale Clothing Online | Port 213
 
Secrets for A Happy Relationship & Marriage.
Secrets for A Happy Relationship & Marriage.Secrets for A Happy Relationship & Marriage.
Secrets for A Happy Relationship & Marriage.
 
The Heirloom Gown: A Tale of Love and Legacy
The Heirloom Gown: A Tale of Love and LegacyThe Heirloom Gown: A Tale of Love and Legacy
The Heirloom Gown: A Tale of Love and Legacy
 
Alex Gurkin: Strategies for a Sustainable Tech Career
Alex Gurkin: Strategies for a Sustainable Tech CareerAlex Gurkin: Strategies for a Sustainable Tech Career
Alex Gurkin: Strategies for a Sustainable Tech Career
 
HVAC Replacement Process for Commercial Buildings Guide
HVAC Replacement Process for Commercial Buildings GuideHVAC Replacement Process for Commercial Buildings Guide
HVAC Replacement Process for Commercial Buildings Guide
 
Beyond Academics - Anibal Romero .pdf
Beyond Academics - Anibal Romero    .pdfBeyond Academics - Anibal Romero    .pdf
Beyond Academics - Anibal Romero .pdf
 

Lingerie Shoot

  • 1. G REEDY-M ATCHING 1 (G) M ←∅ while E(G) = ∅ (*) pick the lexicographically first e ∈ E(G) M ← M ∪ {e} remove e and all edges adjacent to e from E(G) return M Assume the edges in the given graph are ordered pairs (i.e. put a top-down direction on them). E(G) = {(1, 6), (1, 9), (1, 10), (2, 7), (2, 8), (2, 9), (2, 10), (3, 7), (3, 8), (4, 6), (4, 7), (4, 8), (5, 6)} 2
  • 2. The Hungarian algorithm We will start today’s lecture by running through an example. Consider the graph below. We will compare the results of G REEDY-M ATCHING 1 with those of H UNGARIAN -M ATCHING. 1 2 3 4 5 10 9 8 7 6 You are warmly invited to try this at home with paper and pencil first. 1
  • 3. 1 2 3 4 5 10 9 8 7 6 4
  • 4. 1 2 3 4 5 10 9 8 7 6 3
  • 5. 1 2 3 4 5 10 9 8 7 6 6
  • 6. 1 2 3 4 5 10 9 8 7 6 5
  • 7. 1 2 3 4 5 10 9 8 7 6 8
  • 8. 1 2 3 4 5 10 9 8 7 6 7
  • 9. Hungarian algorithm The approach given below seems to have first appeared in the work of K¨ nig (1916, 1931, 1936) and Egerv´ ry (1931) who reduced the problem o a with general non-negative weights on the edges to the unweighted case. H UNGARIAN -M ATCHING (G) let M be any matching in G repeat form a maximal forest F having properties 1. and 2. if there is an edge joining V (F ) ∩ V1 to a vertex in U2 M ← Augment(M, F ) else return M until T RUE 10
  • 10. 1 2 3 4 5 10 9 8 7 6 9
  • 11. 1 2 3 4 5 U1 U2 10 9 8 7 6 12
  • 12. 1 2 3 4 5 U1 U2 10 9 8 7 6 11
  • 13. 1 2 3 4 5 10 9 8 7 6 14
  • 14. 1 2 3 4 5 U1 U2 10 9 8 7 6 13
  • 15. Edmonds’ algorithm The first polynomial time matching algorithm for general graphs was constructed by Edmonds. In this algorithm the key idea of “shrinking” certain odd cycles was introduced. Up to the present time most matching algorithms – certainly the most successful ones – are based (implicitly or explicitly) on this idea. We begin with a lemma which will enable us to reduce the size of the graph under consideration in many cases. The lemma help us understand the crucial step of “cycle shrinking” and lends us confidence that we are not losing necessary information when carrying out such shrinking. 16
  • 16. Maximum matching in general graphs We presented an algorithm for finding a maximum matching in a bipartite graph. From a mathematical point of view, this algorithm is essentially no more involved than the proof of K¨ nig’s equality. o For non-bipartite graphs the situation is quite different. Known poly-time algorithms for finding a maximum matching in a general graph are among the most involved combinatorial algorithms. Most of them are based on augmentation along alternating paths. But important new ideas are needed to turn these tricks into polynomial time algorithms. 15
  • 17. Proof (|M | = ν(G ) ⇒ |M | = ν(G)) Assume that |M | < ν(G). Then there exists an augmenting path P relative to M . Two cases arise: P vertex-disjoint from Z In such case P is also an M -augmenting path, and hence |M | < ν(G ). Contradiction! P does intersect Z W.l.o.g. there must be an endpoint, say x, of P that is not in Z. Let z be the first vertex in the path P which also belongs to Z. The path Q from x to z is mapped onto an M -augmenting path when Z is contracted. Hence |M | < ν(G ). Contradiction! (|M | = ν(G) ⇒ |M | = ν(G )) This time assume M is not maximum. Take a maximum matching N in G . Then expand Z and define a matching N in G. Then |N | = |N | + k > |M | + k = |M |, i.e. M is not a maximum matching. Contradiction! 18
  • 18. Shrinking Lemma. Let G be a graph and M a matching in G. Let Z be a cycle of length 2k + 1 which contains k lines of M and is vertex-disjoint from the rest of M . Let G be the graph obtained from G by shrinking Z to a single vertex. Then M = M E(Z) is a maximum matching in G if and only if M is a maximum matching in G. 17
  • 19. 19-1
  • 20. Algorithm description We now turn to an informal description of Edmonds Matching Algorithm. We are given a graph G. Let M be a matching in G. If M is perfect we are done! Otherwise let S be the set of vertices that are not covered by M . Construct (as in the bipartite case) a forest F such that every connected component of F contains exactly one vertexa of S, every point of S belongs to exactly one component of F , and every edge of F which is at an odd distance from a point in S belongs to M . a It may be defined as the root of the component under consideration. 19
  • 21. “External” outer vertices Next we consider the neighbours of outer vertices. If we find an outer vertex x adjacent to a vertex y not in F , then we can enlarge F by adding the edges {x, y} and {y, z} ∈ M . 21
  • 22. Properties of F Every vertex of F which is at an odd distance from S has degree two in F . Such vertices will be called inner vertices, while the remaining vertices in F will be called outer vertices (in particular all vertices in S are outer). Such a forest is called M -alternating forest. Clearly, the (trivial) forest with vertex set S and no line is an M -alternating forest (although not a very useful one!). 20
  • 23. “Adjacent” outer vertices in the same component Alternating path after switching x y Blossom before shrinking 23
  • 24. “Adjacent” outer vertices in different components If F has two adjacent outer vertices x and y belonging to different components of F , then the roots of these two components of F are connected by an M -augmenting path. We can obtain a larger matching! And after this we restart the process by constructing a new (smaller) F . 22
  • 25. Finally, if every outer vertex has only inner vertices as neighbours, then we claim that the matching M is already maximum. For suppose that F contains m inner vertices and n outer vertices. Clearly |S| = n − m. Furthermore if we delete all the inner vertices of F from G, the remaining graph will contain all the outer vertices of F as isolated points. Hence def(G) ≥ n − m = |S|. But M misses exactly |S| vertices, and so it must be a maximum matching. 25
  • 26. If F has two outer vertices x and y in the same connected component which are adjacent in G, then let C be the cycle formed by the line {x, y} and the path from x to y in F . Let P denote the (unique) patha in F connecting C to a root of F . Clearly P is an M -alternating path, so if we “switch” on P , we obtain another matching M1 of the same size as M . But M1 and C satisfy the conditions of the shrinking Lemma, and so if we shrink C to a single point to obtain a new graph G , we have reduced the task of finding a matching larger than M in G to the task of finding a matching larger than M1 E(C) in the smaller graph G . a We allow C to pass through the root, in which case P consists of a single point. 24
  • 28. In summary we can always do one of the following: • enlarge F , • enlarge M , • decrease |V (G)|, or • stop with a maximum matching! Thus it is clear that the algorithm terminates in polynomial time with a maximum matching in G. 26