Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 2 of 2 for “"minimum s-t cut"”.
-
From graphs to matrices, and back : new techniques for graph algorithms
… problems including: -- The Maximum s-t Flow and Minimum s-t Cut Problems. We develop a new approach to computing (1 - [epsilon])-approximately maximum s-t flow and (1 + [epsilon])-approximately minimum s-t cut in undirected graphs that gives the fastest known algorithms for these tasks. These …
-
Learning on Inhomogeneous Hypergraphs
… for incorporating EDVWs into hypergraph cut problems via introducing a new class of hyperedge splitting functions which are both submodular and dependent on EDVWs. I also generalize existing reduction as well as sparsification techniques to our setting. Finally, I define p-Laplacians for …