{"id":"https://openalex.org/W2086214832","doi":"https://doi.org/10.1016/s0304-3975(96)00274-5","title":"Parallel algorithms for the minimum cut and the minimum length tree layout problems","display_name":"Parallel algorithms for the minimum cut and the minimum length tree layout problems","publication_year":1997,"publication_date":"1997-07-01","ids":{"openalex":"https://openalex.org/W2086214832","doi":"https://doi.org/10.1016/s0304-3975(96)00274-5","mag":"2086214832"},"language":"en","primary_location":{"id":"doi:10.1016/s0304-3975(96)00274-5","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(96)00274-5","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/A5037690759","display_name":"Josep D\u0131\u0301az","orcid":"https://orcid.org/0000-0003-4422-0067"},"institutions":[{"id":"https://openalex.org/I9617848","display_name":"Universitat Polit\u00e8cnica de Catalunya","ror":"https://ror.org/03mb6wj31","country_code":"ES","type":"education","lineage":["https://openalex.org/I9617848"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Josep D\u00edaz","raw_affiliation_strings":["Departament de Llenguatges i Sistemes, Universitat Polit\u00e8cnica Catalunya, Pau Gargallo 5. 08028-Barcelona, Spain"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Departament de Llenguatges i Sistemes, Universitat Polit\u00e8cnica Catalunya, Pau Gargallo 5. 08028-Barcelona, Spain","institution_ids":["https://openalex.org/I9617848"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109875727","display_name":"Alan Gibbons","orcid":null},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Alan Gibbons","raw_affiliation_strings":["Department of Computer Science, University of Warwick, Warwick, UK","Department of Computer Science, University of Warwick, Warwick, UK#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Warwick, Warwick, UK","institution_ids":["https://openalex.org/I39555362"]},{"raw_affiliation_string":"Department of Computer Science, University of Warwick, Warwick, UK#TAB#","institution_ids":["https://openalex.org/I39555362"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001248687","display_name":"Grammati Pantziou","orcid":"https://orcid.org/0000-0002-7890-825X"},"institutions":[{"id":"https://openalex.org/I120729142","display_name":"Computer Technology Institute and Press \u201cDIOPHANTUS\u201d","ror":"https://ror.org/021nszj63","country_code":"GR","type":"facility","lineage":["https://openalex.org/I120729142","https://openalex.org/I4210154149"]}],"countries":["GR"],"is_corresponding":true,"raw_author_name":"Grammati E. Pantziou","raw_affiliation_strings":["Computer Technology Institute, P.O. Box 1122, 26110 Patras, Greece","Computer Technology Institute, P.O. Box 1122, 26110 Patras, Greece#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Technology Institute, P.O. Box 1122, 26110 Patras, Greece","institution_ids":["https://openalex.org/I120729142"]},{"raw_affiliation_string":"Computer Technology Institute, P.O. Box 1122, 26110 Patras, Greece#TAB#","institution_ids":["https://openalex.org/I120729142"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033912650","display_name":"Mar\u0131\u0301a Serna","orcid":"https://orcid.org/0000-0001-9729-8648"},"institutions":[{"id":"https://openalex.org/I9617848","display_name":"Universitat Polit\u00e8cnica de Catalunya","ror":"https://ror.org/03mb6wj31","country_code":"ES","type":"education","lineage":["https://openalex.org/I9617848"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Maria J. Serna","raw_affiliation_strings":["Departament de Llenguatges i Sistemes, Universitat Polit\u00e8cnica Catalunya, Pau Gargallo 5. 08028-Barcelona, Spain"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Departament de Llenguatges i Sistemes, Universitat Polit\u00e8cnica Catalunya, Pau Gargallo 5. 08028-Barcelona, Spain","institution_ids":["https://openalex.org/I9617848"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011756177","display_name":"Paul G. Spirakis","orcid":"https://orcid.org/0000-0001-5396-3749"},"institutions":[{"id":"https://openalex.org/I120729142","display_name":"Computer Technology Institute and Press \u201cDIOPHANTUS\u201d","ror":"https://ror.org/021nszj63","country_code":"GR","type":"facility","lineage":["https://openalex.org/I120729142","https://openalex.org/I4210154149"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Paul G. Spirakis","raw_affiliation_strings":["Computer Technology Institute, P.O. Box 1122, 26110 Patras, Greece","Computer Technology Institute, P.O. Box 1122, 26110 Patras, Greece#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Technology Institute, P.O. Box 1122, 26110 Patras, Greece","institution_ids":["https://openalex.org/I120729142"]},{"raw_affiliation_string":"Computer Technology Institute, P.O. Box 1122, 26110 Patras, Greece#TAB#","institution_ids":["https://openalex.org/I120729142"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027370903","display_name":"Jacobo Tor\u00e1n","orcid":"https://orcid.org/0000-0003-2168-4969"},"institutions":[{"id":"https://openalex.org/I9617848","display_name":"Universitat Polit\u00e8cnica de Catalunya","ror":"https://ror.org/03mb6wj31","country_code":"ES","type":"education","lineage":["https://openalex.org/I9617848"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Jacobo Toran","raw_affiliation_strings":["Departament de Llenguatges i Sistemes, Universitat Polit\u00e8cnica Catalunya, Pau Gargallo 5. 08028-Barcelona, Spain"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Departament de Llenguatges i Sistemes, Universitat Polit\u00e8cnica Catalunya, Pau Gargallo 5. 08028-Barcelona, Spain","institution_ids":["https://openalex.org/I9617848"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5001248687"],"corresponding_institution_ids":["https://openalex.org/I120729142"],"apc_list":{"value":2600,"currency":"USD","value_usd":2600},"apc_paid":null,"fwci":2.1095,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.87090964,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"181","issue":"2","first_page":"267","last_page":"287"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.970300018787384,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.970300018787384,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9478999972343445,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12782","display_name":"Assembly Line Balancing Optimization","score":0.9309999942779541,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.7828035354614258},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.6723552346229553},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6055161356925964},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5930749177932739},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.5877695679664612},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.49993443489074707},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4992797374725342},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4912876486778259},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.4868399500846863},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.46788209676742554},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4531356692314148},{"id":"https://openalex.org/keywords/minimum-description-length","display_name":"Minimum description length","score":0.4378910958766937},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34323596954345703},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.2940167784690857},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.14292138814926147}],"concepts":[{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.7828035354614258},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.6723552346229553},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6055161356925964},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5930749177932739},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.5877695679664612},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.49993443489074707},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4992797374725342},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4912876486778259},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.4868399500846863},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.46788209676742554},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4531356692314148},{"id":"https://openalex.org/C87465248","wikidata":"https://www.wikidata.org/wiki/Q1417790","display_name":"Minimum description length","level":2,"score":0.4378910958766937},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34323596954345703},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2940167784690857},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.14292138814926147},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/s0304-3975(96)00274-5","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(96)00274-5","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.40.6336","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.40.6336","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cti.gr/RD1/publications/International_Conferences/psfiles/43.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6399999856948853,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W42274071","https://openalex.org/W1495826360","https://openalex.org/W1584086289","https://openalex.org/W1965874601","https://openalex.org/W1980008391","https://openalex.org/W2011039300","https://openalex.org/W2012951995","https://openalex.org/W2060378965","https://openalex.org/W2064535593","https://openalex.org/W2081052144","https://openalex.org/W2132750992","https://openalex.org/W2136077635","https://openalex.org/W2395933225","https://openalex.org/W6604083093","https://openalex.org/W6634962901","https://openalex.org/W6665543819","https://openalex.org/W6680453673"],"related_works":["https://openalex.org/W2129497110","https://openalex.org/W1572441411","https://openalex.org/W4289685524","https://openalex.org/W2885987986","https://openalex.org/W3208371434","https://openalex.org/W4225947064","https://openalex.org/W2977612001","https://openalex.org/W2104254980","https://openalex.org/W2285925085","https://openalex.org/W1972720599"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}