{"id":"https://openalex.org/W4254904005","doi":"https://doi.org/10.1109/iccad.1993.580088","title":"A symbolic algorithm for maximum flow in 0-1 networks","display_name":"A symbolic algorithm for maximum flow in 0-1 networks","alternate_titles":[],"publication_year":2002,"publication_date":"2002-12-30","ids":{"openalex":"https://openalex.org/W4254904005","doi":"https://doi.org/10.1109/iccad.1993.580088","mag":"2049385396"},"language":"en","primary_location":{"id":"doi:10.1109/iccad.1993.580088","doi":"https://doi.org/10.1109/iccad.1993.580088","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccad.1993.580088","pdf_url":null,"source":{"id":"https://openalex.org/S4306419226","display_name":"International Conference on Computer Aided Design","issn_l":"1933-7760","issn":["1933-7760"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["jufo-1"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of 1993 International Conference on Computer Aided Design (ICCAD)","raw_type":"proceedings-article"},"parent_works":[],"lineage":["https://openalex.org/W4254904005"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5019892407","display_name":"Gary D. Hachtel","orcid":"https://orcid.org/0000-0002-6810-9067","observed_orcids":["https://orcid.org/0000-0002-6810-9067"]},"institutions":[{"id":"https://openalex.org/I188538660","display_name":"University of Colorado Boulder","ror":"https://ror.org/02ttsq026","country_code":"US","type":"education","lineage":["https://openalex.org/I188538660"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"G.D. Hachtel","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Colorado Boulder, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Colorado Boulder, USA","institution_ids":["https://openalex.org/I188538660"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077549627","display_name":"Fabio Somenzi","orcid":"https://orcid.org/0000-0002-2085-2003","observed_orcids":["https://orcid.org/0000-0002-2085-2003"]},"institutions":[{"id":"https://openalex.org/I188538660","display_name":"University of Colorado Boulder","ror":"https://ror.org/02ttsq026","country_code":"US","type":"education","lineage":["https://openalex.org/I188538660"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"F. Somenzi","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Colorado Boulder, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Colorado Boulder, USA","institution_ids":["https://openalex.org/I188538660"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I188538660"],"apc_list":null,"apc_paid":null,"fwci":2.1167,"has_fulltext":false,"cited_by_count":37,"citation_normalized_percentile":{"value":0.87545083,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"403","last_page":"406"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994999766349792,"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.9994999766349792,"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/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"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/maximum-flow","display_name":"maximum flow","score":0.9679999947547913},{"id":"https://openalex.org/keywords/symbolic-algorithms","display_name":"symbolic algorithms","score":0.7820000052452087},{"id":"https://openalex.org/keywords/edge-matching","display_name":"edge matching","score":0.8759999871253967},{"id":"https://openalex.org/keywords/priority-function","display_name":"priority function","score":0.9440000057220459},{"id":"https://openalex.org/keywords/large-graphs","display_name":"large-scale graphs","score":0.5759999752044678}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.7206555604934692},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.7054389119148254},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6303911805152893},{"id":"https://openalex.org/C75291252","wikidata":"https://www.wikidata.org/wiki/Q1315756","display_name":"TRACE (psycholinguistics)","level":2,"score":0.6194456219673157},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5830209255218506},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5583850741386414},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.5383687019348145},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5382051467895508},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.5221772193908691},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.4821738600730896},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4764818847179413},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32178395986557007},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3155551254749298},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.22635462880134583},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.06629526615142822},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/iccad.1993.580088","doi":"https://doi.org/10.1109/iccad.1993.580088","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccad.1993.580088","pdf_url":null,"source":{"id":"https://openalex.org/S4306419226","display_name":"International Conference on Computer Aided Design","issn_l":"1933-7760","issn":["1933-7760"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["jufo-1"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of 1993 International Conference on Computer Aided Design (ICCAD)","raw_type":"proceedings-article"},{"id":"mag:2049385396","doi":null,"is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/iccad/iccad1993.html#HachtelS93","pdf_url":null,"source":{"id":"https://openalex.org/S4306419226","display_name":"International Conference on Computer Aided Design","issn_l":"1933-7760","issn":["1933-7760"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["jufo-1"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"International Conference on Computer Aided Design","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1754966200","https://openalex.org/W1986875761","https://openalex.org/W2061438988","https://openalex.org/W2080267935","https://openalex.org/W2081013866","https://openalex.org/W2109356398","https://openalex.org/W2135453964","https://openalex.org/W2137657386","https://openalex.org/W2145785237","https://openalex.org/W2161999969","https://openalex.org/W2167435507","https://openalex.org/W2169459573","https://openalex.org/W2340365916","https://openalex.org/W2752885492","https://openalex.org/W2914443076","https://openalex.org/W3014094413","https://openalex.org/W4246239274","https://openalex.org/W4247324697"],"related_works":["https://openalex.org/W2103612457","https://openalex.org/W2378243297","https://openalex.org/W1982016387","https://openalex.org/W2350425297","https://openalex.org/W2010191164","https://openalex.org/W3136340482","https://openalex.org/W2319179780","https://openalex.org/W2258441002","https://openalex.org/W2141038472","https://openalex.org/W2327022868"],"abstract_inverted_index":{"We":[0],"present":[1],"an":[2,63],"algorithm":[3,14],"for":[4,67],"finding":[5],"the":[6,22,27,71,74],"maximum":[7],"flow":[8],"in":[9],"a":[10],"0-1":[11],"network.":[12,28],"The":[13,46],"is":[15,49,59],"symbolic":[16],"and":[17,24],"avoids":[18],"explicit":[19],"enumeration":[20],"of":[21,26,54,70,76],"nodes":[23],"edges":[25],"Therefore,":[29],"it":[30,37],"can":[31],"handle":[32],"much":[33],"larger":[34],"graphs":[35],"than":[36,42],"was":[38],"previously":[39],"possible":[40],"(more":[41],"10/sup":[43],"36/":[44],"edges).":[45],"main":[47],"idea":[48],"to":[50],"trace":[51],"(implicitly)":[52],"sets":[53],"edge-disjoint":[55],"augmenting":[56],"paths.":[57],"Disjointness":[58],"enforced":[60],"by":[61],"solving":[62],"edge":[64],"matching":[65],"problem":[66],"each":[68],"layer":[69],"network":[72],"with":[73],"help":[75],"newly":[77],"defined":[78],"priority":[79],"functions.":[80]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W4254904005","counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2022-05-12T00:00:00"}
