{"id":"https://openalex.org/W2021178630","doi":"https://doi.org/10.1007/s00453-007-9074-x","title":"On Enumerating Minimal Dicuts and Strongly Connected Subgraphs","display_name":"On Enumerating Minimal Dicuts and Strongly Connected Subgraphs","publication_year":2007,"publication_date":"2007-10-26","ids":{"openalex":"https://openalex.org/W2021178630","doi":"https://doi.org/10.1007/s00453-007-9074-x","mag":"2021178630"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-007-9074-x","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-007-9074-x","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-007-9074-x.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00453-007-9074-x.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5110428486","display_name":"Leonid Khachiyan","orcid":null},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]},{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE","US"],"is_corresponding":true,"raw_author_name":"Leonid Khachiyan","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany","Rutgers University, 640 Bartholomew Road, 08854-8003, Piscataway, NJ USA"],"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]},{"raw_affiliation_string":"Rutgers University, 640 Bartholomew Road, 08854-8003, Piscataway, NJ USA","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057621825","display_name":"Endre Boros","orcid":"https://orcid.org/0000-0001-8206-3168"},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Endre Boros","raw_affiliation_strings":["RUTCOR, Rutgers University, 640 Bartholomew Road, 08854-8003, Piscataway, NJ, USA","Rutgers University, RUTCOR, 640 Bartholomew Road, 08854-8003, Piscataway, NJ, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"RUTCOR, Rutgers University, 640 Bartholomew Road, 08854-8003, Piscataway, NJ, USA","institution_ids":["https://openalex.org/I102322142"]},{"raw_affiliation_string":"Rutgers University, RUTCOR, 640 Bartholomew Road, 08854-8003, Piscataway, NJ, USA#TAB#","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000070192","display_name":"Khaled Elbassioni","orcid":"https://orcid.org/0000-0001-7021-5400"},"institutions":[{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"funder","lineage":["https://openalex.org/I149899117"]},{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Khaled Elbassioni","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany","Max-Planck Institut F\u00fcr Informatik, Saarbr\u00fccken, Germany#TAB#"],"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]},{"raw_affiliation_string":"Max-Planck Institut F\u00fcr Informatik, Saarbr\u00fccken, Germany#TAB#","institution_ids":["https://openalex.org/I149899117"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102877110","display_name":"Vladimir Gurvich","orcid":"https://orcid.org/0000-0003-0304-8686"},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Vladimir Gurvich","raw_affiliation_strings":["RUTCOR, Rutgers University, 640 Bartholomew Road, 08854-8003, Piscataway, NJ, USA","Rutgers University, RUTCOR, 640 Bartholomew Road, 08854-8003, Piscataway, NJ, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"RUTCOR, Rutgers University, 640 Bartholomew Road, 08854-8003, Piscataway, NJ, USA","institution_ids":["https://openalex.org/I102322142"]},{"raw_affiliation_string":"Rutgers University, RUTCOR, 640 Bartholomew Road, 08854-8003, Piscataway, NJ, USA#TAB#","institution_ids":["https://openalex.org/I102322142"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5110428486"],"corresponding_institution_ids":["https://openalex.org/I102322142","https://openalex.org/I4210109712"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":1.6108,"has_fulltext":true,"cited_by_count":23,"citation_normalized_percentile":{"value":0.8669855,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"50","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9984999895095825,"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/T11830","display_name":"Point processes and geometric inequalities","score":0.9955000281333923,"subfield":{"id":"https://openalex.org/subfields/2604","display_name":"Applied Mathematics"},"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/combinatorics","display_name":"Combinatorics","score":0.8481490015983582},{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.809687614440918},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7246705293655396},{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.6894969344139099},{"id":"https://openalex.org/keywords/convex-hull","display_name":"Convex hull","score":0.5836256742477417},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5673961639404297},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4678744971752167},{"id":"https://openalex.org/keywords/connected-component","display_name":"Connected component","score":0.4601263701915741},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.44358912110328674},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44026410579681396},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44008147716522217},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.11318323016166687}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8481490015983582},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.809687614440918},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7246705293655396},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.6894969344139099},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.5836256742477417},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5673961639404297},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4678744971752167},{"id":"https://openalex.org/C193435613","wikidata":"https://www.wikidata.org/wiki/Q2997928","display_name":"Connected component","level":2,"score":0.4601263701915741},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.44358912110328674},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44026410579681396},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44008147716522217},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.11318323016166687},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s00453-007-9074-x","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-007-9074-x","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-007-9074-x.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:alma.01RUT_INST:11665192790004646","is_oa":false,"landing_page_url":"https://scholarship.libraries.rutgers.edu/esploro/outputs/journalArticle/On-Enumerating-Minimal-Dicuts-and-Strongly/991031666012104646","pdf_url":null,"source":{"id":"https://openalex.org/S4210197018","display_name":"View","issn_l":"2688-268X","issn":["2688-268X","2688-3988"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"pmh:oai:edoc.mpg.de:428129","is_oa":false,"landing_page_url":"http://edoc.mpg.de/428129","pdf_url":null,"source":{"id":"https://openalex.org/S4406922265","display_name":"Max Planck Institute for Plasma Physics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithmica, v.50, 159-172 (2008)","raw_type":"Article"},{"id":"pmh:oai:pure.mpg.de:item_1325653","is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-000F-1C71-F","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithmica","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1007/s00453-007-9074-x","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-007-9074-x","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-007-9074-x.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6240764752","display_name":"Identification of Threshold, Regular and Submodular Monotone Systems:  Theory and Algorithms","funder_award_id":"0118635","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320310882","display_name":"Center for Discrete Mathematics and Theoretical Computer Science","ror":"https://ror.org/00k551w06"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2021178630.pdf","grobid_xml":"https://content.openalex.org/works/W2021178630.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W1515701089","https://openalex.org/W1538859003","https://openalex.org/W1972004026","https://openalex.org/W1974325422","https://openalex.org/W1974624244","https://openalex.org/W1983281982","https://openalex.org/W1989581254","https://openalex.org/W2011039300","https://openalex.org/W2026784850","https://openalex.org/W2036561027","https://openalex.org/W2051283034","https://openalex.org/W2052453197","https://openalex.org/W2066433035","https://openalex.org/W2080947358","https://openalex.org/W2093776691","https://openalex.org/W2100534385","https://openalex.org/W2117889403","https://openalex.org/W2169621137","https://openalex.org/W2767970464","https://openalex.org/W3111890340","https://openalex.org/W4210731599","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W108845024","https://openalex.org/W2578985712","https://openalex.org/W4300125793","https://openalex.org/W2406961474","https://openalex.org/W2143566611","https://openalex.org/W2013740965","https://openalex.org/W4376608589","https://openalex.org/W588267724","https://openalex.org/W2952598754","https://openalex.org/W4382118228"],"abstract_inverted_index":{"We":[0,23,95],"consider":[1],"the":[2,26,39,93,98,110,126],"problems":[3,30],"of":[4,15,28,47,73,85,100,104],"enumerating":[5],"all":[6,12,82,101],"minimal":[7,13,48,102],"strongly":[8,18],"connected":[9,19],"subgraphs":[10],"and":[11,116],"dicuts":[14,49],"a":[16,45,70,89,123],"given":[17,44,71],"directed":[20],"graph":[21],"G=(V,E).":[22],"show":[24,117],"that":[25,68,118],"first":[27],"these":[29],"can":[31,59],"be":[32,60],"solved":[33],"in":[34,66,88],"incremental":[35],"polynomial":[36],"time,":[37],"while":[38],"second":[40],"problem":[41,120],"is":[42,53,78],"NP-hard:":[43],"collection":[46],"for":[50,69],"G,":[51],"it":[52,58,77],"NP-hard":[54,79],"to":[55,80],"tell":[56],"whether":[57],"extended.":[61],"The":[62],"latter":[63],"result":[64],"implies,":[65],"particular,":[67],"set":[72],"points":[74],"$\\mathcal{A}\\subseteq\\mathbb{R}^{n}$":[75],",":[76],"generate":[81],"maximal":[83],"subsets":[84,103],"$\\mathcal{A}$":[86,105],"contained":[87],"closed":[90],"half-space":[91],"through":[92],"origin.":[94],"also":[96],"discuss":[97],"enumeration":[99],"whose":[106],"convex":[107],"hull":[108],"contains":[109],"origin":[111],"as":[112,122],"an":[113],"interior":[114],"point,":[115],"this":[119],"includes":[121],"special":[124],"case":[125],"well-known":[127],"hypergraph":[128],"transversal":[129],"problem.":[130]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}