{"id":"https://openalex.org/W2047281868","doi":"https://doi.org/10.1007/bf01240738","title":"Network flow and 2-satisfiability","display_name":"Network flow and 2-satisfiability","publication_year":1994,"publication_date":"1994-03-01","ids":{"openalex":"https://openalex.org/W2047281868","doi":"https://doi.org/10.1007/bf01240738","mag":"2047281868"},"language":"en","primary_location":{"id":"doi:10.1007/bf01240738","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01240738","pdf_url":null,"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":null,"license_id":null,"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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5109133948","display_name":"T. Feder","orcid":null},"institutions":[{"id":"https://openalex.org/I4210107053","display_name":"Core Competence","ror":"https://ror.org/012cc0c94","country_code":"US","type":"company","lineage":["https://openalex.org/I4210107053"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Tom\ufffds Feder","raw_affiliation_strings":["Bell Communications Research, 445 South Street, 07960, Morristown, NJ, USA","Bell Communications Research, Morristown, USA 07960#TAB#"],"affiliations":[{"raw_affiliation_string":"Bell Communications Research, 445 South Street, 07960, Morristown, NJ, USA","institution_ids":["https://openalex.org/I4210107053"]},{"raw_affiliation_string":"Bell Communications Research, Morristown, USA 07960#TAB#","institution_ids":["https://openalex.org/I4210107053"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5109133948"],"corresponding_institution_ids":["https://openalex.org/I4210107053"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":74,"citation_normalized_percentile":{"value":0.1719712,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"11","issue":"3","first_page":"291","last_page":"319"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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.9995999932289124,"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.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/T10991","display_name":"Game Theory and Voting Systems","score":0.9958000183105469,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.6813769936561584},{"id":"https://openalex.org/keywords/transitive-closure","display_name":"Transitive closure","score":0.662804365158081},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6514198184013367},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6132795214653015},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.6067255735397339},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5606311559677124},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.5533357858657837},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5268256068229675},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5001239776611328},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.47892674803733826},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46713829040527344},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.44393235445022583},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.422460675239563},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4040214717388153},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3276659846305847}],"concepts":[{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.6813769936561584},{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.662804365158081},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6514198184013367},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6132795214653015},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.6067255735397339},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5606311559677124},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.5533357858657837},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5268256068229675},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5001239776611328},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.47892674803733826},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46713829040527344},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.44393235445022583},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.422460675239563},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4040214717388153},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3276659846305847},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf01240738","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01240738","pdf_url":null,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W1513400187","https://openalex.org/W1717788890","https://openalex.org/W1981139087","https://openalex.org/W1982761864","https://openalex.org/W1998076865","https://openalex.org/W2003160050","https://openalex.org/W2003618558","https://openalex.org/W2009955311","https://openalex.org/W2013415302","https://openalex.org/W2018804864","https://openalex.org/W2020728155","https://openalex.org/W2022287675","https://openalex.org/W2028146345","https://openalex.org/W2033701176","https://openalex.org/W2039408110","https://openalex.org/W2044935944","https://openalex.org/W2046043928","https://openalex.org/W2047631336","https://openalex.org/W2060445186","https://openalex.org/W2061872629","https://openalex.org/W2064600658","https://openalex.org/W2068115726","https://openalex.org/W2079828335","https://openalex.org/W2085944695","https://openalex.org/W2088188524","https://openalex.org/W2091887239","https://openalex.org/W2108186088","https://openalex.org/W2118382442","https://openalex.org/W2123806189","https://openalex.org/W2156036190","https://openalex.org/W2157529519","https://openalex.org/W2340364767","https://openalex.org/W2799004609","https://openalex.org/W3123221209","https://openalex.org/W4254807835","https://openalex.org/W4285719527","https://openalex.org/W4300890427"],"related_works":["https://openalex.org/W2375873432","https://openalex.org/W4206915070","https://openalex.org/W2531764854","https://openalex.org/W2098682899","https://openalex.org/W1964664152","https://openalex.org/W3161514703","https://openalex.org/W2141299097","https://openalex.org/W1851375266","https://openalex.org/W2610002854","https://openalex.org/W3141113327"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":21},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}