2026-09-20T11:30:22Z https://www.ideals.illinois.edu/oai-pmh

oai:www.ideals.illinois.edu:2142/16487 2023-07-10 col_2142_5131 col_2142_10761 com_2142_5130 com_2142_10755 com_2142_234

Erickson, Jeff G. Sundar, Aparna 2010-06-22T19:46:27Z 2010-06-22T19:46:27Z 2010-06-22T19:46:27Z Flows and cuts have been the topic of much study since Ford and Fulkerson's original paper. The problem we look at is the computation of flows on some generalizations of planar graphs. In particular, the input graph can be embedded on a surface of genus g, and has the source and sink on the same face. We show this problem can be reduced to a convex programming problem in dimension 2g, and also show some interesting properties of the feasible polytope. Item withdrawn by Rebecca Bryant (rabryant@illinois.edu) on 2009-12-23T15:51:53Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 7 Sundar_Aparna.pdf: 196978 bytes, checksum: 339649210546151a0c1dee2ec9097024 (MD5) intro.tex: 7073 bytes, checksum: d26622767e2271842e8ed0d30dffba80 (MD5) histnrel.tex: 14699 bytes, checksum: 0067fe64cb6f53da5fe5ecfb2d43936d (MD5) elip5.tex: 16956 bytes, checksum: ca83a5da9d25cb424a6bb69ed2aed694 (MD5) defcheck.tex: 12906 bytes, checksum: 32badd87fc0ec524958e0df1466d321c (MD5) circ4.tex: 10213 bytes, checksum: a8f1e1a3d69345cd6eae347884a5c62d (MD5) thesis-ex.tex: 3466 bytes, checksum: 5efce021fc56a426feff006310467b15 (MD5) 2010-5 Made available in DSpace on 2010-06-22T19:46:27Z (GMT). No. of bitstreams: 8 intro.tex: 7073 bytes, checksum: d26622767e2271842e8ed0d30dffba80 (MD5) histnrel.tex: 14699 bytes, checksum: 0067fe64cb6f53da5fe5ecfb2d43936d (MD5) elip5.tex: 16956 bytes, checksum: ca83a5da9d25cb424a6bb69ed2aed694 (MD5) defcheck.tex: 12906 bytes, checksum: 32badd87fc0ec524958e0df1466d321c (MD5) circ4.tex: 10213 bytes, checksum: a8f1e1a3d69345cd6eae347884a5c62d (MD5) thesis-ex.tex: 3466 bytes, checksum: 5efce021fc56a426feff006310467b15 (MD5) Sundar_Aparna.pdf: 196978 bytes, checksum: 339649210546151a0c1dee2ec9097024 (MD5) license.txt: 4062 bytes, checksum: 55d63c1abe40da846bc8a311b2bf5d75 (MD5) http://hdl.handle.net/2142/16487 en Copyright 2010 Aparna Sundar Homology Flows ellipsoid method More homology flows Computer Science 1434 Computer Science 0112 University of Illinois at Urbana-Champaign Thesis M.S. MS:Computer Science -UIUC 10KS0112MS