COCOON   2008 International Conference on Computing and Combinatorics
Wall of Fame | Most Viewed COCOON-2008 Paper
8 years 5 months ago
Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities
Abstract. We study the maximum flow problem in an undirected planar network with both edge and vertex capacities (EVC-network). A previous study reduces the minimum cut problem in ...
Xianchao Zhang, Weifa Liang, Guoliang Chen
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
1Download preprint from source161
2Download preprint from source138
3Download preprint from source137
4Download preprint from source134
5Download preprint from source131
6Download preprint from source130
7Download preprint from source128
8Download preprint from source126
9Download preprint from source120
10Download preprint from source118
11Download preprint from source118
12Download preprint from source117
13Download preprint from source112
14Download preprint from source112
15Download preprint from source108
16Download preprint from source103
17Download preprint from source102
18Download preprint from source99
19Download preprint from source95
20Download preprint from source95
21Download preprint from source81
22Download preprint from source78