{"id":"https://openalex.org/W1756794180","doi":"https://doi.org/10.1007/3-540-45253-2_9","title":"Fast Algorithms for Even/Odd Minimum Cuts and Generalizations","display_name":"Fast Algorithms for Even/Odd Minimum Cuts and Generalizations","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W1756794180","doi":"https://doi.org/10.1007/3-540-45253-2_9","mag":"1756794180"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-45253-2_9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45253-2_9","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5021452458","display_name":"Andr\u00e1s A. Bencz\u00far","orcid":"https://orcid.org/0000-0002-9392-0986"},"institutions":[{"id":"https://openalex.org/I106118109","display_name":"E\u00f6tv\u00f6s Lor\u00e1nd University","ror":"https://ror.org/01jsq2704","country_code":"HU","type":"education","lineage":["https://openalex.org/I106118109"]},{"id":"https://openalex.org/I7597260","display_name":"Hungarian Academy of Sciences","ror":"https://ror.org/02ks8qq67","country_code":"HU","type":"funder","lineage":["https://openalex.org/I7597260"]}],"countries":["HU"],"is_corresponding":true,"raw_author_name":"Andr\u00e1s A. Bencz\u00far","raw_affiliation_strings":["Computer and Automation Institute, Hungarian Academy of Sciences, and Department of Operations Research, E\u00f6tv\u00f6s University, Budapest"],"affiliations":[{"raw_affiliation_string":"Computer and Automation Institute, Hungarian Academy of Sciences, and Department of Operations Research, E\u00f6tv\u00f6s University, Budapest","institution_ids":["https://openalex.org/I7597260","https://openalex.org/I106118109"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019011569","display_name":"Ott\u00edlia F\u00fcl\u00f6p","orcid":"https://orcid.org/0000-0001-6688-2489"},"institutions":[{"id":"https://openalex.org/I4210105926","display_name":"Institute of Mathematics and Informatics","ror":"https://ror.org/01b5dy719","country_code":"BG","type":"facility","lineage":["https://openalex.org/I24768866","https://openalex.org/I4210105926"]},{"id":"https://openalex.org/I4210120266","display_name":"Czech Academy of Sciences, Institute of Mathematics","ror":"https://ror.org/02tv1yf50","country_code":"CZ","type":"facility","lineage":["https://openalex.org/I202391551","https://openalex.org/I4210120266"]}],"countries":["BG","CZ"],"is_corresponding":false,"raw_author_name":"Ottilia F\u00fcl\u00f6p","raw_affiliation_strings":["Institute of Mathematics, Technical University, Budapest"],"affiliations":[{"raw_affiliation_string":"Institute of Mathematics, Technical University, Budapest","institution_ids":["https://openalex.org/I4210105926","https://openalex.org/I4210120266"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5021452458"],"corresponding_institution_ids":["https://openalex.org/I106118109","https://openalex.org/I7597260"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.8973,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.76229241,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"88","last_page":"99"},"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.9998999834060669,"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.9998999834060669,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9980000257492065,"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/T12288","display_name":"Optimization and Search Problems","score":0.9930999875068665,"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/combinatorics","display_name":"Combinatorics","score":0.7506598234176636},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.7077393531799316},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6238738298416138},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5766397714614868},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5109288096427917},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.4882054626941681},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4589863717556},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.4225849211215973},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.42250511050224304},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.41184690594673157},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.41053932905197144},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4046083092689514},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39173492789268494},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.32052090764045715}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7506598234176636},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.7077393531799316},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6238738298416138},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5766397714614868},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5109288096427917},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.4882054626941681},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4589863717556},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.4225849211215973},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.42250511050224304},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.41184690594673157},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.41053932905197144},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4046083092689514},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39173492789268494},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32052090764045715},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/3-540-45253-2_9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45253-2_9","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.105.6612","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.105.6612","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ilab.sztaki.hu/~benczur/Mypapers/ESA-2000.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.24.9612","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.24.9612","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.sztaki.hu/~benczur/Mypapers/ESA-2000.ps.gz","raw_type":"text"},{"id":"pmh:oai:eprints.sztaki.hu:2302","is_oa":false,"landing_page_url":"http://eprints.sztaki.hu/2302/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401907","display_name":"SZTAKI Publication Repository (Hungarian Academy of Sciences)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I7597260","host_organization_name":"Hungarian Academy of Sciences","host_organization_lineage":["https://openalex.org/I7597260"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Book Section"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W41039768","https://openalex.org/W157855400","https://openalex.org/W1498671329","https://openalex.org/W1544515183","https://openalex.org/W1568500790","https://openalex.org/W1972631197","https://openalex.org/W1977545325","https://openalex.org/W1988310809","https://openalex.org/W2012079975","https://openalex.org/W2012329067","https://openalex.org/W2050977796","https://openalex.org/W2088221897","https://openalex.org/W2095284441","https://openalex.org/W2100440346","https://openalex.org/W2115049345","https://openalex.org/W2117754372","https://openalex.org/W2123805664","https://openalex.org/W6605328767"],"related_works":["https://openalex.org/W2186707160","https://openalex.org/W1974018476","https://openalex.org/W2903538031","https://openalex.org/W2129497110","https://openalex.org/W2141353198","https://openalex.org/W2115772827","https://openalex.org/W2942946217","https://openalex.org/W2078695342","https://openalex.org/W1588356204","https://openalex.org/W2130132511"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}