<?xml version='1.0' encoding='UTF-8'?><?xml-stylesheet href='static/style.xsl' type='text/xsl'?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T10:43:41Z</responseDate><request verb="GetRecord" identifier="oai:ecommons.cornell.edu:1813/116538" metadataPrefix="dim">https://ecommons.cornell.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:ecommons.cornell.edu:1813/116538</identifier><datestamp>2026-05-15T19:51:59Z</datestamp><setSpec>com_1813_35</setSpec><setSpec>col_1813_47</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author">Ntanavaras, Sotiris</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="chair" lang="en_US">Williamson, David</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember" lang="en_US">Banerjee, Siddhartha</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember" lang="en_US">Gunluk, Oktay</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2025-01-14T20:00:21Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2025-01-14T20:00:21Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2024-08</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="other">ProQuest Submission ID: 14550</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="other">ProQuest Publication ID: 31487935</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/1813/116538</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="doi">https://doi.org/10.7298/0f2t-8873</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="bibid">16611968</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">86 pages</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">Graphs offer a way to naturally represent data from different sources, such as social networks, road networks, the web and many others. Over the last few years, a lot of these networks have grown significantly in size, requiring the development of efficient algorithms that partition the networks into smaller, easier comprehensible blocks. We develop highly efficient algorithms for the problem of finding all minimum cutsand finding all near-minimum cuts. Using several data reduction techniques, we are able to reduce a given input graph by orders of magnitude. We then implement optimized versions of some existing algorithms, which allows us to solve both problems on huge graphs in a few minutes.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso">en</dim:field>
   <dim:field mdschema="dc" element="rights" lang="*">Attribution 4.0 International</dim:field>
   <dim:field mdschema="dc" element="rights" qualifier="uri" lang="*">https://creativecommons.org/licenses/by/4.0/</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Implementations of Cut Algorithms</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">dissertation or thesis</dim:field>
   <dim:field mdschema="dc" element="relation" qualifier="localuri">https://newcatalog.library.cornell.edu/catalog/16611968</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="discipline">Operations Research and Information Engineering</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="grantor">Cornell University</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="level">Doctor of Philosophy</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="name">Ph. D., Operations Research and Information Engineering</dim:field>
   <dim:field mdschema="dcterms" element="license">https://hdl.handle.net/1813/59810.2</dim:field>
   <dim:field mdschema="dspace" element="entity" qualifier="type">Publication</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="collection" authority="https://cornell-ecommons.eks.prod.4science.cloud/handle/1813/47" confidence="600">Cornell Theses and Dissertations</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="author">Ntanavaras, Sotiris</dim:field>
   <dim:field mdschema="cris" element="virtualsource" qualifier="collection">5893a6ea-7af3-41d7-abc6-04bcd26ab5df</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="cerif" element="openaire" authority="" confidence="-1">&lt;Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="5d75cd50-918c-4518-a273-73943f85be82">
	&lt;Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843&lt;/Type>
	&lt;Language>en&lt;/Language>
   	&lt;Title>Implementations of Cut Algorithms&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2024-08&lt;/PublicationDate>
   	&lt;DOI>https://doi.org/10.7298/0f2t-8873&lt;/DOI>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Ntanavaras, Sotiris&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
	&lt;/Authors>
   	&lt;Editors>
	&lt;/Editors>
    &lt;Publishers>
        &lt;Publisher>
            &lt;OrgUnit />
        &lt;/Publisher>
    &lt;/Publishers>
    &lt;License>https://creativecommons.org/licenses/by/4.0/&lt;/License>
   	&lt;Abstract>Graphs offer a way to naturally represent data from different sources, such as social networks, road networks, the web and many others. Over the last few years, a lot of these networks have grown significantly in size, requiring the development of efficient algorithms that partition the networks into smaller, easier comprehensible blocks. We develop highly efficient algorithms for the problem of finding all minimum cutsand finding all near-minimum cuts. Using several data reduction techniques, we are able to reduce a given input graph by orders of magnitude. We then implement optimized versions of some existing algorithms, which allows us to solve both problems on huge graphs in a few minutes.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>