{"id":"https://openalex.org/W3035243270","doi":null,"title":"HEURISTICS FOR SPARSEST CUT APPROXIMATIONS IN NETWORK FLOW APPLICATIONS","display_name":"HEURISTICS FOR SPARSEST CUT APPROXIMATIONS IN NETWORK FLOW APPLICATIONS","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3035243270","mag":"3035243270"},"language":"en","primary_location":{"id":"pmh:oai:scholar.smu.edu:engineering_compsci_etds-1014","doi":null,"is_oa":true,"landing_page_url":"https://scholar.smu.edu/engineering_compsci_etds/12","pdf_url":"https://scholar.smu.edu/engineering_compsci_etds/12","source":{"id":"https://openalex.org/S4377196617","display_name":"SMU Scholar (Southern Methodist University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I178169726","host_organization_name":"Southern Methodist University","host_organization_lineage":["https://openalex.org/I178169726"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computer Science and Engineering Theses and Dissertations","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://scholar.smu.edu/engineering_compsci_etds/12","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5026741216","display_name":"Fernando E. Vilas","orcid":"https://orcid.org/0000-0002-9125-2769","observed_orcids":["https://orcid.org/0000-0002-9125-2769"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Fernando E. Vilas","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-9125-2769","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5026741216"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.0017000000225380063,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.00019999999494757503,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/sparsest-cut","display_name":"sparsest cut","score":0.875},{"id":"https://openalex.org/keywords/heuristic-algorithms","display_name":"heuristic algorithms","score":0.6190000176429749},{"id":"https://openalex.org/keywords/community-detection","display_name":"community detection","score":0.9710000157356262},{"id":"https://openalex.org/keywords/social-network-analysis","display_name":"social network analysis","score":0.9340000152587891},{"id":"https://openalex.org/keywords/network-flow","display_name":"network flow","score":0.746999979019165},{"id":"https://openalex.org/keywords/memory-efficiency","display_name":"memory efficiency","score":0.45899999141693115},{"id":"https://openalex.org/keywords/runtime-performance","display_name":"runtime performance","score":0.35199999809265137}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6908829808235168},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.4524376392364502},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4474294185638428},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4330781400203705},{"id":"https://openalex.org/C193386753","wikidata":"https://www.wikidata.org/wiki/Q1130396","display_name":"Approximations of \u03c0","level":2,"score":0.43157434463500977},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.42518144845962524},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3792111277580261},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36114537715911865},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.33741480112075806},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07230842113494873}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:scholar.smu.edu:engineering_compsci_etds-1014","doi":null,"is_oa":true,"landing_page_url":"https://scholar.smu.edu/engineering_compsci_etds/12","pdf_url":"https://scholar.smu.edu/engineering_compsci_etds/12","source":{"id":"https://openalex.org/S4377196617","display_name":"SMU Scholar (Southern Methodist University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I178169726","host_organization_name":"Southern Methodist University","host_organization_lineage":["https://openalex.org/I178169726"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computer Science and Engineering Theses and Dissertations","raw_type":"text"},{"id":"mag:3035243270","doi":null,"is_oa":false,"landing_page_url":"https://scholar.smu.edu/cgi/viewcontent.cgi?article=1014&context=engineering_compsci_etds","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:scholar.smu.edu:engineering_compsci_etds-1014","doi":null,"is_oa":true,"landing_page_url":"https://scholar.smu.edu/engineering_compsci_etds/12","pdf_url":"https://scholar.smu.edu/engineering_compsci_etds/12","source":{"id":"https://openalex.org/S4377196617","display_name":"SMU Scholar (Southern Methodist University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I178169726","host_organization_name":"Southern Methodist University","host_organization_lineage":["https://openalex.org/I178169726"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computer Science and Engineering Theses and Dissertations","raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3035243270.pdf","grobid_xml":"https://content.openalex.org/works/W3035243270.grobid-xml"},"referenced_works_count":87,"referenced_works":["https://openalex.org/W7068497","https://openalex.org/W123956087","https://openalex.org/W174659872","https://openalex.org/W1502895366","https://openalex.org/W1520302490","https://openalex.org/W1571037334","https://openalex.org/W1572663059","https://openalex.org/W1595148576","https://openalex.org/W1964119857","https://openalex.org/W1964477602","https://openalex.org/W1969471925","https://openalex.org/W1971421925","https://openalex.org/W1971937094","https://openalex.org/W1973546017","https://openalex.org/W1976196087","https://openalex.org/W1989177948","https://openalex.org/W1989720410","https://openalex.org/W1991182684","https://openalex.org/W1997033059","https://openalex.org/W2003856348","https://openalex.org/W2007572995","https://openalex.org/W2008231303","https://openalex.org/W2008485591","https://openalex.org/W2008620264","https://openalex.org/W2010223239","https://openalex.org/W2011039300","https://openalex.org/W2011301426","https://openalex.org/W2015370254","https://openalex.org/W2020750044","https://openalex.org/W2025392770","https://openalex.org/W2027826061","https://openalex.org/W2028362055","https://openalex.org/W2030724586","https://openalex.org/W2033918735","https://openalex.org/W2043869514","https://openalex.org/W2044014069","https://openalex.org/W2047940964","https://openalex.org/W2054665888","https://openalex.org/W2057463094","https://openalex.org/W2080633915","https://openalex.org/W2081846387","https://openalex.org/W2084652510","https://openalex.org/W2089126542","https://openalex.org/W2092206153","https://openalex.org/W2095293504","https://openalex.org/W2104734478","https://openalex.org/W2106773138","https://openalex.org/W2117443930","https://openalex.org/W2118492081","https://openalex.org/W2120358419","https://openalex.org/W2127093012","https://openalex.org/W2127101191","https://openalex.org/W2127405101","https://openalex.org/W2127608358","https://openalex.org/W2131681506","https://openalex.org/W2139318963","https://openalex.org/W2149342630","https://openalex.org/W2150071934","https://openalex.org/W2151252959","https://openalex.org/W2154196599","https://openalex.org/W2157316274","https://openalex.org/W2160185408","https://openalex.org/W2165174896","https://openalex.org/W2171744456","https://openalex.org/W2175648958","https://openalex.org/W2271934614","https://openalex.org/W2297216682","https://openalex.org/W2397571699","https://openalex.org/W2402685070","https://openalex.org/W2569054741","https://openalex.org/W2609119641","https://openalex.org/W2611147814","https://openalex.org/W2743418339","https://openalex.org/W2767544505","https://openalex.org/W2769133055","https://openalex.org/W2784007581","https://openalex.org/W2787294759","https://openalex.org/W2788734704","https://openalex.org/W2792457335","https://openalex.org/W2803831948","https://openalex.org/W2805819890","https://openalex.org/W2920848482","https://openalex.org/W2944079414","https://openalex.org/W2952682756","https://openalex.org/W2962921664","https://openalex.org/W2970959587","https://openalex.org/W3103071483"],"related_works":["https://openalex.org/W2028362055","https://openalex.org/W1976196087","https://openalex.org/W2043670738","https://openalex.org/W171417149","https://openalex.org/W2035652501","https://openalex.org/W2159872727","https://openalex.org/W3005261803","https://openalex.org/W1989720410","https://openalex.org/W7099451692","https://openalex.org/W2794098650"],"abstract_inverted_index":{"The":[0,133],"Maximum":[1,141],"Concurrent":[2],"Flow":[3],"Problem":[4],"(MCFP)":[5],"is":[6,25,56],"a":[7,19,78,86],"polynomially":[8,57],"bounded":[9],"problem":[10],"that":[11,118,187],"has":[12],"been":[13],"used":[14,26,154],"over":[15],"the":[16,31,52,59,116,125,140,149,152,160,164,188],"years":[17],"in":[18,43,48,63,122,167],"variety":[20],"of":[21,91,169,178,197],"applications.":[22,184],"Sometimes":[23],"it":[24,55,67,74],"to":[27,29,40,93,106,113,115,147,163],"attempt":[28],"find":[30,41,186],"Sparsest":[32],"Cut,":[33],"an":[34],"NP-hard":[35],"problem,":[36],"and":[37,145,151,172,193,201],"other":[38],"times":[39],"communities":[42],"Social":[44],"Network":[45],"Analysis":[46],"(SNA)":[47],"its":[49],"hierarchical":[50],"formulation,":[51],"HMCFP.":[53],"Though":[54],"bounded,":[58],"MCFP":[60,117,150],"quickly":[61],"grows":[62],"space":[64],"utilization,":[65],"rendering":[66],"useful":[68],"on":[69,139,175],"only":[70,77],"small":[71],"problems.":[72],"When":[73],"was":[75],"defined,":[76],"few":[79,87],"hundred":[80],"nodes":[81,96],"could":[82],"be":[83,99],"solved,":[84],"where":[85],"decades":[88],"later,":[89],"graphs":[90,180],"one":[92],"two":[94,135],"thousand":[95],"can":[97],"still":[98],"too":[100],"much":[101],"for":[102,155],"modern":[103],"commodity":[104],"hardware":[105],"handle.":[107],"This":[108],"dissertation":[109],"covers":[110],"three":[111,161],"approaches":[112,136,162],"heuristics":[114,189],"run":[119,194],"significantly":[120],"faster":[121],"practice":[123],"than":[124],"LP":[126,165],"formulation":[127],"with":[128],"far":[129],"less":[130,199],"memory":[131,173,200],"utilization.":[132],"first":[134],"are":[137,190],"based":[138],"Adjacency":[142],"Search":[143],"(MAS)":[144],"apply":[146],"both":[148],"HMCFP":[153],"community":[156],"detection.":[157],"We":[158,185],"compare":[159],"performance":[166],"terms":[168],"accuracy,":[170],"runtime,":[171],"utilization":[174],"several":[176],"classes":[177],"synthetic":[179],"representing":[181],"potential":[182],"real-world":[183],"often":[191],"correct,":[192],"using":[195],"orders":[196],"magnitude":[198],"time.":[202]},"counts_by_year":[],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2020-06-19T00:00:00"}