Network Flow Column

  

Maximum Flow
POJ 1273 Drainage ditches
POJ 1274 the Perfect Stall (binary graph matching)
POJ 1698 Alice ' s chance (composition)
POJ 1459 Power Network (composition)
POJ 2112 Optimal Milking (two points)
POJ 2455 Secret Milking Machine (two points)
POJ 3189 Steady Cow Assignment (enumeration)
POJ 1637 Sightseeing Tour (mixed graph Euro-pull loop)
POJ 3498 March of the Penguins (enumeration meeting point)
POJ 1087 A Plug for UNIX
POJ 1149 Pigs (composition problem)
ZOJ 2760 How many shortest path (edge does not intersect the shortest number of strips)
POJ 2391 ombrophobic bovines (must be removed.) Otherwise there is a bug)
WHU 1124 Football Coach (composition problem)
SGU 326 Perspective (composition problem, similar to WHU 1124)
UVa 563 Crimewave
UVa 820 Internet Bandwidth
POJ 3281 Dining (composition problem)
POJ 3436 ACM Computer Factory
POJ 2289 Jamie's contact Groups (two minutes)
SGU 438 the glorious Karlutka river =) (Split by Time)
SGU 242 Student ' s morning (output a set of solutions)
SGU 185 Two shortest (Dijkstra pretreatment, two augmentation. Must be implemented with adjacency arrays. otherwise MLE)
Hoj 2816 Power Line
POJ 2699 The Maximum number of strong Kings (enumeration + composition)
ZOJ 2332 Gems
Joj 2453 Candy (composition problem)
SOJ3312 Stockholm Knights
SOJ3353 Total Flow
SOJ2414 Leapin ' lizards-
Minimum cut
SOJ3106 Dual Core CPU
SOJ3109 Space Flight
SOJ3107 Select
SOJ3185 Black and White
SOJ3254 Rain and Fgj
SOJ3134 Windy and Mercury--Mercury transportation
Hoj 2634 how to earn more
ZOJ 2071 Technology Trader (for cutting edge)
Hnu 10940 Coconuts
ZOJ 2532 Internship (for key cutting edges)
POJ 1815 Friendship (smallest point cut set in dictionary order)
POJ 3204 Ikki's Story i-road reconstruction (find key cut edges)
POJ 3308 Paratroopers
POJ 3084 Panic
POJ 3469 Dual Core CPU
ZOJ 2587 unique Attack (minimum cut uniqueness determination)
POJ 2125 destroying the Graph (for cutting edges)
ZOJ 2539 Energy Minimization
Tju 2944 mussy Paper (maximum weight closed sub-graph)
POJ 1966 Cable TV Network (undirected graph-point connectivity)
HDU 1565 squares Fetch (1) (Maximum point weight independent set)
HDU 1569 Squares Fetch (2) (Maximum point weight independent set)
POJ 2987 firing (maximum weight closed sub-graph)
SPOJ 839 Optimal Marks (convert XOR operation to minimum cut per bit)
Hoj 2811 earthquake Damage (min. Cut set)
Beijing regional Contest problem A destroying the bus stations (BFS pretreatment) (Http://acmicpc-live-archive.uva.es/nuevopo rtal/data/problem.php?p=4322)
ZOJ 2676 Network Wars (number of searches)
POJ 3155 Hard Life (search)
ZOJ 3241 Being a Hero

There are upper and lower bounds
ZOJ 2314 Reactor Cooling (no Yuanhui feasible flow)
POJ 2396 Budget (with Yuanhui feasible flow)
SGU 176 flow Construction (with Yuanhui minimum flow)
ZOJ 3229 Shoot The Bullet (with Yuanhui maximum flow)
HDU 3157 Crazy circuits (with Yuanhui minimum flow)

Minimum cost flow
Hoj 2715 Matrix3
Hoj 2739 the Chinese Postman problem
POJ 2175 Evacuation Plan (elimination of a negative circle)
POJ 3422 Kaka ' s Matrix travels (similar to Matrix3)
POJ 2516 Minimum cost (several times by item type)
POJ 2195 going Home
BUAA 1032 destroying a Painting
POJ 2400 Supervisor, supervisee (output all minimum weights matched)
POJ 3680 Intervals
Hoj 2543 Stone IV
POJ 2135 Farm Tour
BASHU2445 Napkin Problem
---------------------------------------------Onmylove Original

Maximum flow problem:

TC :

Single Round Match Round 1–division I, Level Three

Single Round Match 236 Round 1–division I, Level Three

Single Round Match 399 Round 1–division I, Level Three

Same Hoj1024: http://acm.hust.edu.cn/thx/problem.php?id=1024

2003 TCO semifinal Round 4–division I, Level Three

2004 TCCC Championship Round–division I, Level Three

2005 TCO Sponsor track Round 3–division I, Level One

Euler Circuit of mixed graphs

Poj1637: http://acm.pku.edu.cn/JudgeOnline/problem?id=1637

zju1992 :http://acm.zju.edu.cn/show_problem.php?

To seek an augmented edge:

Poj3204 :http://acm.pku.edu.cn/JudgeOnline/problem?id=3204

Similar:Hoj1082: http://acm.hust.edu.cn/thx/problem.php?cid=1017&pid=6

Project Selection Questions:

Poj3469 :http://acm.pku.edu.cn/JudgeOnline/problem?id=3469

Zoj2930 :http://acm.zju.edu.cn/show_problem.php?

pid=2930

Projects to select the most projects.

Build diagram:

Poj1149 :http://acm.pku.edu.cn/JudgeOnline/problem?id=1149

Poj3436 :http://acm.pku.edu.cn/JudgeOnline/problem?id=3436

Poj3281 :http://acm.pku.edu.cn/JudgeOnline/problem?id=3281

Degree of connectivity:

Point Connectivity Poj1966: Http://acm.pku.edu.cn/JudgeOnline/problem?

id=1966

http://icpcres.ecs.baylor.edu/onlinejudge/

The problem of the number of points not to be broken, need to split the point

Minimum cut:

Poj2914 :http://acm.pku.edu.cn/JudgeOnline/problem?id=2914

(Stoer-wagner)

Basic questions:

Poj3498 :http://acm.pku.edu.cn/JudgeOnline/problem?

id=3498

Enumeration : do n times the maximum stream.

Poj1087 :http://acm.pku.edu.cn/JudgeOnline/problem?

id=1087

Can be done with the maximum flow, can also be matched with a binary graph.

Poj1273 :http://acm.pku.edu.cn/JudgeOnline/problem?id=1273

Poj1274 :http://acm.pku.edu.cn/JudgeOnline/problem?id=1274

Poj1325:http://acm.pku.edu.cn/judgeonline/problem?

id=1325

poj1459 :http://acm.pku.edu.cn/JudgeOnline/problem?id=1459

Poj1797 :http://acm.pku.edu.cn/JudgeOnline/problem?id=1797

Poj1815 :http://acm.pku.edu.cn/JudgeOnline/problem?id=1815

poj2112:http://acm.pku.edu.cn/JudgeOnline/problem?id=2112

poj2239:http://acm.pku.edu.cn/JudgeOnline/problem?id=2239

Poj2289:http://acm.pku.edu.cn/judgeonline/problem?

id=2289

Poj2391 : Http://acm.pku.edu.cn/JudgeOnline/problem?

id=2391

Poj2987 :http://acm.pku.edu.cn/JudgeOnline/problem?id=2987

Poj3308 :http://acm.pku.edu.cn/JudgeOnline/problem?id=3308

Tip: Maximum weight closure, converted to maximum flow

poj3155:http://acm.pku.edu.cn/judgeonline/problem?id=3155

Difficult

http://acm.sgu.ru/problem.php?contest=0&problem=176

Network flow problem with upper and lower capacity. It's difficult.

Spoj660:http://www.spoj.pl/problems/QUEST4/

Spoj377:http://www.spoj.pl/problems/TAXI/

http://icpcres.ecs.baylor.edu/onlinejudge/

753,

10735.

Copyright notice: This article blog original articles, blogs, without consent, may not be reproduced.

Network Flow Column