{"id":"https://openalex.org/W2075355581","doi":"https://doi.org/10.1016/0020-0190(85)90036-5","title":"A note on finding minimum cuts in directed planar networks by parallel computations","display_name":"A note on finding minimum cuts in directed planar networks by parallel computations","publication_year":1985,"publication_date":"1985-08-01","ids":{"openalex":"https://openalex.org/W2075355581","doi":"https://doi.org/10.1016/0020-0190(85)90036-5","mag":"2075355581"},"language":"en","primary_location":{"id":"doi:10.1016/0020-0190(85)90036-5","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(85)90036-5","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"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":"Information Processing Letters","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/A5012195869","display_name":"Ladislav Janiga","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ladislav Janiga","raw_affiliation_strings":["Moravanu 68, 169 00 Praha 6, Czechoslovakia"],"affiliations":[{"raw_affiliation_string":"Moravanu 68, 169 00 Praha 6, Czechoslovakia","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031559202","display_name":"V\u00e1c\u0142av Koubek","orcid":null},"institutions":[{"id":"https://openalex.org/I4210143490","display_name":"Computing Center","ror":"https://ror.org/0557kgc34","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I4210143490","https://openalex.org/I4210148470"]},{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ","RU"],"is_corresponding":false,"raw_author_name":"Vaclav Koubek","raw_affiliation_strings":["Computing Center, Faculty of Mathematics and Physics, Charles University, Malostranske nam. 25, 11800 Praha 1, Czechoslovakia"],"affiliations":[{"raw_affiliation_string":"Computing Center, Faculty of Mathematics and Physics, Charles University, Malostranske nam. 25, 11800 Praha 1, Czechoslovakia","institution_ids":["https://openalex.org/I4210143490","https://openalex.org/I21250087"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5012195869"],"corresponding_institution_ids":[],"apc_list":{"value":2200,"currency":"USD","value_usd":2200},"apc_paid":null,"fwci":1.069,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.81615461,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"21","issue":"2","first_page":"75","last_page":"78"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9993000030517578,"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"}},"topics":[{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9993000030517578,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9968000054359436,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.994700014591217,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/computer-science","display_name":"Computer science","score":0.6872376203536987},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.6694422960281372},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.657230794429779},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5942509770393372},{"id":"https://openalex.org/keywords/sorting-network","display_name":"Sorting network","score":0.5521237254142761},{"id":"https://openalex.org/keywords/analysis-of-parallel-algorithms","display_name":"Analysis of parallel algorithms","score":0.5092929601669312},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.4965823292732239},{"id":"https://openalex.org/keywords/bulk-synchronous-parallel","display_name":"Bulk synchronous parallel","score":0.48461875319480896},{"id":"https://openalex.org/keywords/topological-sorting","display_name":"Topological sorting","score":0.46543967723846436},{"id":"https://openalex.org/keywords/parallel-processing","display_name":"Parallel processing","score":0.44850507378578186},{"id":"https://openalex.org/keywords/model-of-computation","display_name":"Model of computation","score":0.44742539525032043},{"id":"https://openalex.org/keywords/interconnection","display_name":"Interconnection","score":0.4444962441921234},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4395647943019867},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3547353744506836},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.2877047061920166},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26132264733314514},{"id":"https://openalex.org/keywords/sorting-algorithm","display_name":"Sorting algorithm","score":0.2551949918270111}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6872376203536987},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.6694422960281372},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.657230794429779},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5942509770393372},{"id":"https://openalex.org/C64540648","wikidata":"https://www.wikidata.org/wiki/Q646477","display_name":"Sorting network","level":4,"score":0.5521237254142761},{"id":"https://openalex.org/C538114610","wikidata":"https://www.wikidata.org/wiki/Q24282658","display_name":"Analysis of parallel algorithms","level":3,"score":0.5092929601669312},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.4965823292732239},{"id":"https://openalex.org/C156891508","wikidata":"https://www.wikidata.org/wiki/Q1004114","display_name":"Bulk synchronous parallel","level":3,"score":0.48461875319480896},{"id":"https://openalex.org/C176032523","wikidata":"https://www.wikidata.org/wiki/Q753127","display_name":"Topological sorting","level":3,"score":0.46543967723846436},{"id":"https://openalex.org/C106515295","wikidata":"https://www.wikidata.org/wiki/Q26806595","display_name":"Parallel processing","level":2,"score":0.44850507378578186},{"id":"https://openalex.org/C184596265","wikidata":"https://www.wikidata.org/wiki/Q2651576","display_name":"Model of computation","level":3,"score":0.44742539525032043},{"id":"https://openalex.org/C123745756","wikidata":"https://www.wikidata.org/wiki/Q1665949","display_name":"Interconnection","level":2,"score":0.4444962441921234},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4395647943019867},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3547353744506836},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.2877047061920166},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26132264733314514},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.2551949918270111},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0020-0190(85)90036-5","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(85)90036-5","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"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":"Information Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","score":0.6200000047683716,"display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W190838824","https://openalex.org/W1530753374","https://openalex.org/W1964119857","https://openalex.org/W1981706003","https://openalex.org/W2039086323","https://openalex.org/W2071939274","https://openalex.org/W6645559178"],"related_works":["https://openalex.org/W2360642665","https://openalex.org/W1981558729","https://openalex.org/W1586380695","https://openalex.org/W55423022","https://openalex.org/W3082558912","https://openalex.org/W136616184","https://openalex.org/W2151077742","https://openalex.org/W2146067253","https://openalex.org/W2070732426","https://openalex.org/W2075355581"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}