{"id":"https://openalex.org/W2103746934","doi":"https://doi.org/10.1007/s00453-007-9111-9","title":"Generating Cut Conjunctions in Graphs and Related\u00a0Problems","display_name":"Generating Cut Conjunctions in Graphs and Related\u00a0Problems","publication_year":2007,"publication_date":"2007-10-26","ids":{"openalex":"https://openalex.org/W2103746934","doi":"https://doi.org/10.1007/s00453-007-9111-9","mag":"2103746934"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-007-9111-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-007-9111-9","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-007-9111-9.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-9111-9.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"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Leonid Khachiyan","raw_affiliation_strings":["Department of Computer Science, Rutgers University, 640 Bartholomew Road, Piscataway, NJ, 08854-8003, USA","Rutgers University, Department of Computer Science, 640 Bartholomew Road, 08854-8003, Piscataway, NJ, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Rutgers University, 640 Bartholomew Road, Piscataway, NJ, 08854-8003, USA","institution_ids":["https://openalex.org/I102322142"]},{"raw_affiliation_string":"Rutgers University, Department of Computer Science, 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, Piscataway, NJ, 08854-8003, USA","Rutgers University, RUTCOR, 640 Bartholomew Road, 08854-8003, Piscataway, NJ, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"RUTCOR, Rutgers University, 640 Bartholomew Road, Piscataway, NJ, 08854-8003, 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/A5049075685","display_name":"Konrad Borys","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"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Konrad Borys","raw_affiliation_strings":["RUTCOR, Rutgers University, 640 Bartholomew Road, Piscataway, NJ, 08854-8003, USA","Rutgers University, RUTCOR, 640 Bartholomew Road, 08854-8003, Piscataway, NJ, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"RUTCOR, Rutgers University, 640 Bartholomew Road, Piscataway, NJ, 08854-8003, 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/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"]},{"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"]}],"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":"middle","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, Piscataway, NJ, 08854-8003, USA","Rutgers University, RUTCOR, 640 Bartholomew Road, 08854-8003, Piscataway, NJ, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"RUTCOR, Rutgers University, 640 Bartholomew Road, Piscataway, NJ, 08854-8003, 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":"last","author":{"id":"https://openalex.org/A5110768204","display_name":"Kazuhisa Makino","orcid":"https://orcid.org/0009-0000-9771-4955"},"institutions":[{"id":"https://openalex.org/I74801974","display_name":"The University of Tokyo","ror":"https://ror.org/057zh3y96","country_code":"JP","type":"education","lineage":["https://openalex.org/I74801974"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Kazuhisa Makino","raw_affiliation_strings":["Department of Mathematical Informatics, Graduate School of Information and Technology, University of Tokyo, Tokyo, 113-8656, Japan","University of Tokyo, Department of Mathematical Informatics, Graduate School of Information and Technology, 113-8656, Tokyo, Japan#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Mathematical Informatics, Graduate School of Information and Technology, University of Tokyo, Tokyo, 113-8656, Japan","institution_ids":["https://openalex.org/I74801974"]},{"raw_affiliation_string":"University of Tokyo, Department of Mathematical Informatics, Graduate School of Information and Technology, 113-8656, Tokyo, Japan#TAB#","institution_ids":["https://openalex.org/I74801974"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5110428486"],"corresponding_institution_ids":["https://openalex.org/I102322142"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.3765,"has_fulltext":true,"cited_by_count":16,"citation_normalized_percentile":{"value":0.65673759,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"51","issue":"3","first_page":"239","last_page":"263"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9983000159263611,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/matroid","display_name":"Matroid","score":0.8899251222610474},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8815284967422485},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7261232137680054},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6380293369293213},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49226251244544983},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.46313124895095825},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.45528966188430786},{"id":"https://openalex.org/keywords/graphic-matroid","display_name":"Graphic matroid","score":0.4385480284690857},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4353390336036682},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.4325394630432129},{"id":"https://openalex.org/keywords/hypercube","display_name":"Hypercube","score":0.41557639837265015},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.15405616164207458}],"concepts":[{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.8899251222610474},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8815284967422485},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7261232137680054},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6380293369293213},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49226251244544983},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.46313124895095825},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.45528966188430786},{"id":"https://openalex.org/C111034964","wikidata":"https://www.wikidata.org/wiki/Q5597156","display_name":"Graphic matroid","level":3,"score":0.4385480284690857},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4353390336036682},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.4325394630432129},{"id":"https://openalex.org/C50820777","wikidata":"https://www.wikidata.org/wiki/Q213723","display_name":"Hypercube","level":2,"score":0.41557639837265015},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.15405616164207458}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00453-007-9111-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-007-9111-9","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-007-9111-9.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:11665149820004646","is_oa":false,"landing_page_url":"https://scholarship.libraries.rutgers.edu/esploro/outputs/journalArticle/Generating-Cut-Conjunctions-in-Graphs-and/991031666073204646","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"}],"best_oa_location":{"id":"doi:10.1007/s00453-007-9111-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-007-9111-9","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-007-9111-9.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/W2103746934.pdf","grobid_xml":"https://content.openalex.org/works/W2103746934.grobid-xml"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W344142806","https://openalex.org/W1972004026","https://openalex.org/W1974624244","https://openalex.org/W2007940874","https://openalex.org/W2069702698","https://openalex.org/W2080947358","https://openalex.org/W2086542011","https://openalex.org/W2093776691","https://openalex.org/W2116983645","https://openalex.org/W2118966355","https://openalex.org/W2121154824","https://openalex.org/W2121589182","https://openalex.org/W2150815458","https://openalex.org/W2167046094","https://openalex.org/W2611804663","https://openalex.org/W2767970464","https://openalex.org/W2988480584","https://openalex.org/W4230573295","https://openalex.org/W4243953177"],"related_works":["https://openalex.org/W2058489697","https://openalex.org/W2106412416","https://openalex.org/W4367050287","https://openalex.org/W2046319394","https://openalex.org/W146649319","https://openalex.org/W2072414647","https://openalex.org/W2550106438","https://openalex.org/W2494200571","https://openalex.org/W2409819057","https://openalex.org/W4298343133"],"abstract_inverted_index":{"Let":[0],"G=(V,E)":[1],"be":[2,9,155],"an":[3,17,62],"undirected":[4],"graph,":[5],"and":[6,134],"let":[7],"B\u2286V\u00d7V":[8],"a":[10,53,78,89,102],"collection":[11],"of":[12,34,57,88,137,145],"vertex":[13],"pairs.":[14],"We":[15,59],"give":[16],"incremental":[18,63],"polynomial":[19,64],"time":[20,65],"algorithm":[21,66],"to":[22,131,154],"generate":[23,109],"all":[24,48,69,110],"minimal":[25,49,70,111],"edge":[26],"sets":[27],"X\u2286E":[28,72,113],"such":[29,73,114],"that":[30,74,93,115],"every":[31],"pair":[32,55],"(s,t)\u2208B":[33,76],"vertices":[35],"is":[36,77,119],"disconnected":[37],"in":[38,80],"(V,E":[39],"\u2216":[40,123],"X),":[41],"generalizing":[42],"well-known":[43],"efficient":[44],"algorithms":[45],"for":[46,52,67,99,149],"generating":[47,68,96,146],"s-t":[50],"cuts,":[51],"given":[54,101],"s,t":[56],"vertices.":[58],"also":[60],"present":[61],"subsets":[71,112],"no":[75,116],"bridge":[79],"(V,X\u222aB).":[81],"Both":[82],"above":[83,127],"problems":[84],"are":[85],"special":[86,128],"cases":[87],"more":[90,142],"general":[91,143],"problem":[92,144],"we":[94],"call":[95],"cut":[97,147],"conjunctions":[98,148],"matroids:":[100],"matroid":[103],"M":[104],"on":[105],"ground":[106],"set":[107],"S=E\u222aB,":[108],"element":[117],"b\u2208B":[118],"spanned":[120],"by":[121],"E":[122],"X.":[124],"Unlike":[125],"the":[126,132,138,141],"cases,":[129],"corresponding":[130],"cycle":[133],"cocycle":[135],"matroids":[136,151],"graph":[139],"(V,E\u222aB),":[140],"vectorial":[150],"turns":[152],"out":[153],"NP-hard.":[156]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-03-15T09:29:46.208133","created_date":"2025-10-10T00:00:00"}