Global ETD Search

About
The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.

1	Single Commodity Flow Algorithms for Lifts of Graphic and Cographic Matroids Stuive, Leanne January 2013 (has links) Consider a binary matroid M given by its matrix representation. We show that if M is a lift of a graphic or a cographic matroid, then in polynomial time we can either solve the single commodity flow problem for M or find an obstruction for which the Max-Flow Min-Cut relation does not hold. The key tool is an algorithmic version of Lehman's Theorem for the set covering polyhedron. discrete optimization matroid flows Combinatorics and Optimization
2	Single Commodity Flow Algorithms for Lifts of Graphic and Cographic Matroids Stuive, Leanne January 2013 (has links) Consider a binary matroid M given by its matrix representation. We show that if M is a lift of a graphic or a cographic matroid, then in polynomial time we can either solve the single commodity flow problem for M or find an obstruction for which the Max-Flow Min-Cut relation does not hold. The key tool is an algorithmic version of Lehman's Theorem for the set covering polyhedron. discrete optimization matroid flows Combinatorics and Optimization