{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/16487"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/16487","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"More homology flows","abstract":"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.","abstract_html":"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.","abstract_has_math":false,"creators":["Sundar, Aparna"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"M.S.","degree_level":"Thesis","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Erickson, Jeff G."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2010,"date_issued":"2010-06-22T19:46:27Z","date_published":"2010-06-22T19:46:27Z","updated_at":"2026-07-22T22:25:09Z","subjects":["Homology Flows","ellipsoid method"],"languages":["en"],"rights":["Copyright 2010 Aparna Sundar"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/16487","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Erickson, Jeff G."]},{"key":"dc:creator","label":"Author","values":["Sundar, Aparna"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2010-06-22T19:46:27Z","2010-5"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Homology Flows","ellipsoid method"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2010 Aparna Sundar"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/16487"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["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)","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)"]},{"key":"dc:title","label":"Title","values":["More homology flows"]}]}],"canonical_facts":{"dc:contributor":["Erickson, Jeff G."],"dc:creator":["Sundar, Aparna"],"dc:date":["2010-06-22T19:46:27Z","2010-5"],"dc:description":["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)","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)"],"dc:identifier":["http://hdl.handle.net/2142/16487"],"dc:language":["en"],"dc:rights":["Copyright 2010 Aparna Sundar"],"dc:subject":["Homology Flows","ellipsoid method"],"dc:title":["More homology flows"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["M.S."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:09Z"}