{"id":"https://openalex.org/W2996205869","doi":"https://doi.org/10.1007/s00453-019-00658-6","title":"Speeding Up the Gomory-Hu Parallel Cut Tree Algorithm with Efficient Graph Contractions","display_name":"Speeding Up the Gomory-Hu Parallel Cut Tree Algorithm with Efficient Graph Contractions","publication_year":2019,"publication_date":"2019-12-14","ids":{"openalex":"https://openalex.org/W2996205869","doi":"https://doi.org/10.1007/s00453-019-00658-6","mag":"2996205869"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-019-00658-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-019-00658-6","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/A5072780884","display_name":"Charles Maske","orcid":null},"institutions":[{"id":"https://openalex.org/I52418104","display_name":"Universidade Federal do Paran\u00e1","ror":"https://ror.org/05syd6y78","country_code":"BR","type":"education","lineage":["https://openalex.org/I52418104"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Charles Maske","raw_affiliation_strings":["Department Informatics, Federal University of Parana, Curitiba, Brazil"],"affiliations":[{"raw_affiliation_string":"Department Informatics, Federal University of Parana, Curitiba, Brazil","institution_ids":["https://openalex.org/I52418104"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072677004","display_name":"Jaime Cohen","orcid":"https://orcid.org/0000-0002-9393-7729"},"institutions":[{"id":"https://openalex.org/I68207295","display_name":"Universidade Estadual de Ponta Grossa","ror":"https://ror.org/027s08w94","country_code":"BR","type":"education","lineage":["https://openalex.org/I68207295"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Jaime Cohen","raw_affiliation_strings":["Department Informatics, State University of Ponta Grossa, Ponta Grossa, Brazil"],"affiliations":[{"raw_affiliation_string":"Department Informatics, State University of Ponta Grossa, Ponta Grossa, Brazil","institution_ids":["https://openalex.org/I68207295"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052547062","display_name":"Elias P. Duarte","orcid":"https://orcid.org/0000-0002-8916-3302"},"institutions":[{"id":"https://openalex.org/I52418104","display_name":"Universidade Federal do Paran\u00e1","ror":"https://ror.org/05syd6y78","country_code":"BR","type":"education","lineage":["https://openalex.org/I52418104"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Elias P. Duarte","raw_affiliation_strings":["Department Informatics, Federal University of Parana, Curitiba, Brazil"],"affiliations":[{"raw_affiliation_string":"Department Informatics, Federal University of Parana, Curitiba, Brazil","institution_ids":["https://openalex.org/I52418104"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5072780884"],"corresponding_institution_ids":["https://openalex.org/I52418104"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.1469,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.49008456,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"82","issue":"6","first_page":"1601","last_page":"1615"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9958000183105469,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9825000166893005,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5794580578804016},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.571282684803009},{"id":"https://openalex.org/keywords/dependability","display_name":"Dependability","score":0.5224310755729675},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49959468841552734},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.47427424788475037},{"id":"https://openalex.org/keywords/block-graph","display_name":"Block graph","score":0.45896199345588684},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4547516703605652},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.45392462611198425},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3945009410381317},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.34504324197769165},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.337876558303833},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3263794183731079},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.290767639875412}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5794580578804016},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.571282684803009},{"id":"https://openalex.org/C77019957","wikidata":"https://www.wikidata.org/wiki/Q2689057","display_name":"Dependability","level":2,"score":0.5224310755729675},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49959468841552734},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.47427424788475037},{"id":"https://openalex.org/C43413943","wikidata":"https://www.wikidata.org/wiki/Q4927193","display_name":"Block graph","level":5,"score":0.45896199345588684},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4547516703605652},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.45392462611198425},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3945009410381317},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.34504324197769165},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.337876558303833},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3263794183731079},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.290767639875412},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00453-019-00658-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-019-00658-6","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":[{"id":"https://openalex.org/G7991638849","display_name":null,"funder_award_id":"311451/2016-0","funder_id":"https://openalex.org/F4320322025","funder_display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico"}],"funders":[{"id":"https://openalex.org/F4320322025","display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","ror":"https://ror.org/03swz6y49"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W390146837","https://openalex.org/W1720522800","https://openalex.org/W1860789630","https://openalex.org/W1986207529","https://openalex.org/W1991870829","https://openalex.org/W1993808777","https://openalex.org/W2032591091","https://openalex.org/W2036618034","https://openalex.org/W2042852020","https://openalex.org/W2058955289","https://openalex.org/W2105316179","https://openalex.org/W2107139394","https://openalex.org/W2112090702","https://openalex.org/W2115049345","https://openalex.org/W2122466336","https://openalex.org/W2124637492","https://openalex.org/W2152284345","https://openalex.org/W2162550772","https://openalex.org/W2163263459","https://openalex.org/W2279278398","https://openalex.org/W2612000064","https://openalex.org/W2905110430","https://openalex.org/W2962678445","https://openalex.org/W3000811701"],"related_works":["https://openalex.org/W2959395619","https://openalex.org/W2295830426","https://openalex.org/W2016823805","https://openalex.org/W2606892216","https://openalex.org/W2044289376","https://openalex.org/W2068595367","https://openalex.org/W1992093136","https://openalex.org/W3213475073","https://openalex.org/W4313389576","https://openalex.org/W4293463670"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}