{"id":"https://openalex.org/W95318493","doi":"https://doi.org/10.17169/refubium-23083","title":"A simple hypergraph min cut algorithm","display_name":"A simple hypergraph min cut algorithm","publication_year":1996,"publication_date":"1996-01-01","ids":{"openalex":"https://openalex.org/W95318493","doi":"https://doi.org/10.17169/refubium-23083","mag":"95318493"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.31.4535","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.31.4535","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://fubinf.inf.fu-berlin.de/pub/reports/tr-b-96-02.ps.gz","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.17169/refubium-23083","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5007260585","display_name":"Regina Klimmek","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Klimmek, Regina","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Wagner, Frank","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wagner, Frank","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4801,"has_fulltext":false,"cited_by_count":48,"citation_normalized_percentile":{"value":0.52787995,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":98},"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":1.0,"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":1.0,"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":9.999999747378752e-05,"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.0,"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/graph-partitioning","display_name":"graph partitioning","score":0.6669999957084656},{"id":"https://openalex.org/keywords/hyperedges","display_name":"hyperedges","score":0.5690000057220459},{"id":"https://openalex.org/keywords/algorithm-correctness-proof","display_name":"algorithm correctness proof","score":0.47999998927116394},{"id":"https://openalex.org/keywords/runtime-complexity","display_name":"runtime complexity","score":0.5680000185966492}],"concepts":[{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.7236793637275696},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6010135412216187},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.5271230340003967},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4454551041126251},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3864545226097107},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3247072100639343},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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":4,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.31.4535","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.31.4535","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://fubinf.inf.fu-berlin.de/pub/reports/tr-b-96-02.ps.gz","raw_type":"text"},{"id":"pmh:oai:refubium.fu-berlin.de:fub188/19430","doi":null,"is_oa":false,"landing_page_url":"https://refubium.fu-berlin.de/handle/fub188/19430","pdf_url":null,"source":{"id":"https://openalex.org/S4306402444","display_name":"Refubium (Universit\u00e4tsbibliothek der Freien Universit\u00e4t Berlin)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I75951250","host_organization_name":"Freie Universit\u00e4t Berlin","host_organization_lineage":["https://openalex.org/I75951250"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Arbeitspapier"},{"id":"doi:10.17169/refubium-23083","doi":"https://doi.org/10.17169/refubium-23083","is_oa":true,"landing_page_url":"https://doi.org/10.17169/refubium-23083","pdf_url":null,"source":{"id":"https://openalex.org/S7407052913","display_name":"Universit\u00e4tsbibliothek der FU Berlin Hochschulschriftenstelle u. Dokumentenserver","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},{"id":"mag:95318493","doi":null,"is_oa":false,"landing_page_url":"http://edocs.fu-berlin.de/docs/servlets/MCRFileNodeServlet/FUDOCS_derivate_000000000297/1996_02.pdf","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":"doi:10.17169/refubium-23083","doi":"https://doi.org/10.17169/refubium-23083","is_oa":true,"landing_page_url":"https://doi.org/10.17169/refubium-23083","pdf_url":null,"source":{"id":"https://openalex.org/S7407052913","display_name":"Universit\u00e4tsbibliothek der FU Berlin Hochschulschriftenstelle u. Dokumentenserver","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W7099952897","https://openalex.org/W2491454164","https://openalex.org/W1981202693","https://openalex.org/W2903204436","https://openalex.org/W7118294960","https://openalex.org/W1936503156","https://openalex.org/W4417167339","https://openalex.org/W2067062892","https://openalex.org/W1490251704","https://openalex.org/W2057463094"],"abstract_inverted_index":{"We":[0],"present":[1],"an":[2,10],"algorithm":[3],"for":[4],"finding":[5],"the":[6,53,56,59],"minimum":[7],"cut":[8],"of":[9,36,55,58],"edge-weighted":[11],"hypergraph.":[12],"It":[13,19],"is":[14,26,40,52],"simple":[15,34],"in":[16],"every":[17],"respect.":[18],"has":[20,31],"a":[21,32],"short":[22],"and":[23,30],"compact":[24],"description,":[25],"easy":[27],"to":[28],"implement":[29],"surprisingly":[33],"proof":[35],"correctness.":[37],"The":[38],"runtime":[39],"O(jV":[41],"j":[42,47],"2":[43],"log":[44],"jV":[45],"j+jV":[46],"\\\\Delta":[48],"jjEjj)":[49],"where":[50],"jjEjj":[51],"sum":[54],"cardinalities":[57],"hyperedges.":[60]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-11-03T10:50:19.383937","created_date":"2016-06-24T00:00:00"}