{"id":"https://openalex.org/W3090768320","doi":"https://doi.org/10.1007/s00453-023-01127-x","title":"A Weight-Scaling Algorithm for f-Factors of Multigraphs","display_name":"A Weight-Scaling Algorithm for f-Factors of Multigraphs","publication_year":2023,"publication_date":"2023-05-18","ids":{"openalex":"https://openalex.org/W3090768320","doi":"https://doi.org/10.1007/s00453-023-01127-x","mag":"3090768320"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-023-01127-x","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-023-01127-x","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/A5001013961","display_name":"Harold N. Gabow","orcid":"https://orcid.org/0000-0002-9775-3492"},"institutions":[{"id":"https://openalex.org/I188538660","display_name":"University of Colorado Boulder","ror":"https://ror.org/02ttsq026","country_code":"US","type":"education","lineage":["https://openalex.org/I188538660"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Harold N. Gabow","raw_affiliation_strings":["Department of Computer Science, University of Colorado at Boulder, Boulder, CO, 80309-0430, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Colorado at Boulder, Boulder, CO, 80309-0430, USA","institution_ids":["https://openalex.org/I188538660"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5001013961"],"corresponding_institution_ids":["https://openalex.org/I188538660"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.403,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.61017006,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"85","issue":"10","first_page":"3214","last_page":"3289"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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.9998999834060669,"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/T12288","display_name":"Optimization and Search Problems","score":0.9987000226974487,"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/combinatorics","display_name":"Combinatorics","score":0.8224650621414185},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6957282423973083},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6609848737716675},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5402722954750061},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4830070734024048},{"id":"https://openalex.org/keywords/multigraph","display_name":"Multigraph","score":0.4809229075908661},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4434528350830078},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44174402952194214},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.41091281175613403},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3250659108161926}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8224650621414185},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6957282423973083},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6609848737716675},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5402722954750061},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4830070734024048},{"id":"https://openalex.org/C17758045","wikidata":"https://www.wikidata.org/wiki/Q2642629","display_name":"Multigraph","level":3,"score":0.4809229075908661},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4434528350830078},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44174402952194214},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.41091281175613403},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3250659108161926},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00453-023-01127-x","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-023-01127-x","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":26,"referenced_works":["https://openalex.org/W1969357318","https://openalex.org/W1999545213","https://openalex.org/W2003813631","https://openalex.org/W2008292658","https://openalex.org/W2023658462","https://openalex.org/W2028503265","https://openalex.org/W2040326319","https://openalex.org/W2065295938","https://openalex.org/W2084224084","https://openalex.org/W2090168101","https://openalex.org/W2091299439","https://openalex.org/W2124852572","https://openalex.org/W2125690626","https://openalex.org/W2157529519","https://openalex.org/W2222512263","https://openalex.org/W2327315803","https://openalex.org/W2340149117","https://openalex.org/W2551688242","https://openalex.org/W2605161051","https://openalex.org/W2636785804","https://openalex.org/W2782000683","https://openalex.org/W2913132751","https://openalex.org/W2988480584","https://openalex.org/W3011535808","https://openalex.org/W4214659657","https://openalex.org/W6630482551"],"related_works":["https://openalex.org/W1986875491","https://openalex.org/W2928744449","https://openalex.org/W4288402605","https://openalex.org/W3048715473","https://openalex.org/W4300815962","https://openalex.org/W2567825307","https://openalex.org/W205329642","https://openalex.org/W4295762832","https://openalex.org/W1592682627","https://openalex.org/W2016715486"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}