Files in this item



application/pdfSundar_Aparna.pdf (197kB)
(no description provided)PDF


Title:More homology flows
Author(s):Sundar, Aparna
Advisor(s):Erickson, Jeff G.
Department / Program:Computer Science
Discipline:Computer Science
Degree Granting Institution:University of Illinois at Urbana-Champaign
Subject(s):Homology Flows
ellipsoid method
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.
Issue Date:2010-06-22
Rights Information:Copyright 2010 Aparna Sundar
Date Available in IDEALS:2010-06-22
Date Deposited:May 2010

This item appears in the following Collection(s)

Item Statistics