{"id":"https://openalex.org/W1965997748","doi":"https://doi.org/10.1016/0304-3975(90)90101-m","title":"The binary network flow problem is logspace complete for P","display_name":"The binary network flow problem is logspace complete for P","publication_year":1990,"publication_date":"1990-10-01","ids":{"openalex":"https://openalex.org/W1965997748","doi":"https://doi.org/10.1016/0304-3975(90)90101-m","mag":"1965997748"},"language":"en","primary_location":{"id":"doi:10.1016/0304-3975(90)90101-m","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(90)90101-m","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","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/A5023556977","display_name":"Thomas Lengauer","orcid":"https://orcid.org/0000-0003-3801-2640"},"institutions":[{"id":"https://openalex.org/I206945453","display_name":"Paderborn University","ror":"https://ror.org/058kzsd48","country_code":"DE","type":"education","lineage":["https://openalex.org/I206945453"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Thomas Lengauer","raw_affiliation_strings":["Fachbereich 17, Universit\u00e4t-GH Paderborn, D-4790 Paderborn, F.R.G"],"affiliations":[{"raw_affiliation_string":"Fachbereich 17, Universit\u00e4t-GH Paderborn, D-4790 Paderborn, F.R.G","institution_ids":["https://openalex.org/I206945453"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031190525","display_name":"Klaus W. Wagner","orcid":null},"institutions":[{"id":"https://openalex.org/I25974101","display_name":"University of W\u00fcrzburg","ror":"https://ror.org/00fbnyb24","country_code":"DE","type":"education","lineage":["https://openalex.org/I25974101"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Klaus W. Wagner","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t W\u00fcrzburg, D-8700 W\u00fcrzburg, F.R.G"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t W\u00fcrzburg, D-8700 W\u00fcrzburg, F.R.G","institution_ids":["https://openalex.org/I25974101"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5023556977"],"corresponding_institution_ids":["https://openalex.org/I206945453"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":0.9889,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.71549183,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"75","issue":"3","first_page":"357","last_page":"363"},"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.9990000128746033,"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.9990000128746033,"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.9987000226974487,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9983999729156494,"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/mathematics","display_name":"Mathematics","score":0.6664564609527588},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6169912815093994},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4797210097312927},{"id":"https://openalex.org/keywords/np-complete","display_name":"NP-complete","score":0.4624808728694916},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4585639238357544},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.4168321192264557},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.4156950116157532},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3537329435348511},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.13357657194137573}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6664564609527588},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6169912815093994},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4797210097312927},{"id":"https://openalex.org/C122749075","wikidata":"https://www.wikidata.org/wiki/Q215206","display_name":"NP-complete","level":3,"score":0.4624808728694916},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4585639238357544},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.4168321192264557},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.4156950116157532},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3537329435348511},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.13357657194137573},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0304-3975(90)90101-m","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(90)90101-m","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1527768578","https://openalex.org/W1975146994","https://openalex.org/W1982347904","https://openalex.org/W1986804393","https://openalex.org/W2059378738","https://openalex.org/W2088956149","https://openalex.org/W6631632589","https://openalex.org/W6643870468"],"related_works":["https://openalex.org/W2062731608","https://openalex.org/W1519201794","https://openalex.org/W2606468876","https://openalex.org/W1629505938","https://openalex.org/W2767824041","https://openalex.org/W1828234149","https://openalex.org/W2082247452","https://openalex.org/W2384822215","https://openalex.org/W1987322712","https://openalex.org/W4297670669"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}