随笔分类 - 二分图
摘要:Running a taxi station is not all that simple. Apart from the obvious demand for a centralised coordination of the cabs in order to pi...
阅读全文
摘要:Once upon a time there lived a king and he had N sons. And there were N beautiful girls in the kingdom and the king knew about each of...
阅读全文
摘要:There are a group of students. Some of them may know each other, while others don't. For example, A and B know each other, B and C kno...
阅读全文
摘要:(1)二分图的最大匹配匈牙利算法(可以用最大流做,但一般匈牙利要快不少)。(2)二分图的最小点覆盖二分图的最小点覆盖 = 二分图的最大匹配(3)二分图的最少边覆盖二分图的最少边覆盖 = 点数 - 二分图的最大匹配(4)二分图的最大独立集二分图的最大独立集 = 点数 -...
阅读全文
摘要:Consider a town where all the streets are one-way and each street leads from one intersection to another. It is also known that starti...
阅读全文