COCOON 2008 - PDF Preprint Papers

COCOON 2008 International Conference on Computing and Combinatorics

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed COCOON-2008 Paper

click to vote

COCOON
2008
Springer

161views Combinatorics» more COCOON 2008»

Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities

13 years 6 months ago

Download cs.anu.edu.au

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

claim paper

Read More »

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.

Id	Views	Title	Status

1	161	Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities	claim
2	138	The Computational Complexity of Link Building	claim
3	137	Average-Case Competitive Analyses for One-Way Trading	claim
4	134	Dimensions of Points in Self-similar Fractals	claim
5	131	Approximating the Generalized Capacitated Tree-Routing Problem	claim
6	130	A Linear Programming Duality Approach to Analyzing Strictly Nonblocking d-ary Multilog Networks under General Crosstalk Constraints	claim
7	128	Haplotype Inferring Via Galled-Tree Networks Is NP-Complete	claim
8	126	Damaged BZip Files Are Difficult to Repair	claim
9	120	Spreading Messages	claim
10	118	Multi-party Quantum Communication Complexity with Routed Messages	claim
11	118	Counting Polycubes without the Dimensionality Curse	claim
12	117	On the Complexity of Equilibria Problems in Angel-Daemon Games	claim
13	112	On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints	claim
14	112	Complexity of Counting the Optimal Solutions	claim
15	108	Quasi-bicliques: Complexity and Binding Pairs	claim
16	103	Polychromatic Colorings of n-Dimensional Guillotine-Partitions	claim
17	102	Sequence Alignment Algorithms for Run-Length-Encoded Strings	claim
18	99	Visual Cryptography on Graphs	claim
19	95	Efficient Compression of Web Graphs	claim
20	95	Spectrum Bidding in Wireless Networks and Related	claim
21	81	Probe Ptolemaic Graphs	claim
22	78	Optimal Insertion of a Segment Highway in a City Metric	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers