{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

hw9 - AMS/MBA 546(Fall 2010 Estie Arkin Network Flows...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
AMS/MBA 546 (Fall, 2010) Estie Arkin Network Flows Homework Set # 9 (last) Due Thursday, December 9, 2010. 1). Stable marriages with an unequal number of men and women: Let W be the set of women and M be the set of men, and assume that | W | < | M | . A matching is unstable if there is a man m and woman w such that: m and w are not partners in the matching; m is either unmarried, or prefers w to his wife in the matching; w is either unmarried, or prefers m to her husband in the matching. Prove that a stable marriage always exists. 2). Given an undirected graph G = ( N, E ), recall that χ ( G ) is the (node) colouring number of G (the fewest colours needed to colour all nodes of G ), and α ( G ) is the size of the largest independent (stable) set (subset of nodes no two of which are connected by an edge). The following parts are independet of each other. (a). Show that χ ( G ) · α ( G ) n where n is the number of nodes in G . (b). Let G be a tree. Give a polynomial time algorithm for computing α ( G ). (c). Let G be a planar graph. Give a polynomial time approximation algorithm that returns an independent
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

Ask a homework question - tutors are online