lecture17 - CS 435 : Linear Optimization Fall 2008 Lecture...

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

View Full Document Right Arrow Icon

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

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

Unformatted text preview: CS 435 : Linear Optimization Fall 2008 Lecture 17: Graph Algorithms: Matchings Lecturer: Sundar Vishwanathan Computer Science & Engineering Indian Institute of Technology, Bombay In this lecture we reviewed old material. Mostly data structures. We noted that graphs will be repre- sented by adjacency lists for this course. We then de ned a matching, given below. 1 Matching Definition 1 A matching in a graph is a set of edges, no two of which share an end-point. Our interest is the following problem: Input: Graph G . Output: Find a maximum cardinality matching in G . We wish to design an algorithm (polynomial time) for this problem. How do we begin our design? The only real design technique is induction, which you should try out rst. We will pass this for the time being. One way is to start with some matching and then see if you can improve this. For the greedy method, you would have tried some kind of local exchanges. They do not quite work here....
View Full Document

This note was uploaded on 01/04/2010 for the course CSE CS435 taught by Professor Profsundar during the Summer '09 term at IIT Bombay.

Page1 / 2

lecture17 - CS 435 : Linear Optimization Fall 2008 Lecture...

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

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