乐胖代购免代理版

{"id":"https://openalex.org/W2153617527","doi":"https://doi.org/10.1002/rsa.20578","title":"Expected time complexity of the auction algorithm and the push relabel algorithm for maximum bipartite matching on random graphs","display_name":"Expected time complexity of the auction algorithm and the push relabel algorithm for maximum bipartite matching on random graphs","publication_year":2014,"publication_date":"2014-12-23","ids":{"openalex":"https://openalex.org/W2153617527","doi":"https://doi.org/10.1002/rsa.20578","mag":"2153617527"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1002/rsa.20578","pdf_url":null,"source":{"id":"https://openalex.org/S59667848","display_name":"Random Structures and Algorithms","issn_l":"1042-9832","issn":["1042-9832","1098-2418"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"journal-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/A5020146315","display_name":"Oshri Naparstek","orcid":null},"institutions":[{"id":"https://openalex.org/I13955877","display_name":"Bar-Ilan University","ror":"https://ror.org/03kgsv495","country_code":"IL","type":"education","lineage":["https://openalex.org/I13955877"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Oshri Naparstek","raw_affiliation_strings":["School of Engineering; Bar-Ilan University; 52900 Ramat-Gan Israel"],"affiliations":[{"raw_affiliation_string":"School of Engineering; Bar-Ilan University; 52900 Ramat-Gan Israel","institution_ids":["https://openalex.org/I13955877"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019966334","display_name":"Amir Leshem","orcid":"https://orcid.org/0000-0002-2265-7463"},"institutions":[{"id":"https://openalex.org/I13955877","display_name":"Bar-Ilan University","ror":"https://ror.org/03kgsv495","country_code":"IL","type":"education","lineage":["https://openalex.org/I13955877"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Amir Leshem","raw_affiliation_strings":["School of Engineering; Bar-Ilan University; 52900 Ramat-Gan Israel"],"affiliations":[{"raw_affiliation_string":"School of Engineering; Bar-Ilan University; 52900 Ramat-Gan Israel","institution_ids":["https://openalex.org/I13955877"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":4330,"currency":"USD","value_usd":4330,"provenance":"doaj"},"apc_paid":null,"fwci":0.57,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":10,"citation_normalized_percentile":{"value":0.774934,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":86,"max":87},"biblio":{"volume":"48","issue":"2","first_page":"384","last_page":"395"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997,"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.9997,"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.9994,"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/T10237","display_name":"Cryptography and Data Security","score":0.9984,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/auction-algorithm","display_name":"Auction algorithm","score":0.5881965},{"id":"https://openalex.org/keywords/hopcroft\u2013karp-algorithm","display_name":"Hopcroft\u2013Karp algorithm","score":0.5490079},{"id":"https://openalex.org/keywords/3-dimensional-matching","display_name":"3-dimensional matching","score":0.43482125}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.83375585},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.64118344},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6315355},{"id":"https://openalex.org/C74979957","wikidata":"https://www.wikidata.org/wiki/Q4819604","display_name":"Auction algorithm","level":5,"score":0.5881965},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5664523},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.5622286},{"id":"https://openalex.org/C100107663","wikidata":"https://www.wikidata.org/wiki/Q1516988","display_name":"Hopcroft\u2013Karp algorithm","level":5,"score":0.5490079},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.50360245},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.49810314},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.48530024},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.46222177},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.44726932},{"id":"https://openalex.org/C72545166","wikidata":"https://www.wikidata.org/wiki/Q10866593","display_name":"3-dimensional matching","level":4,"score":0.43482125},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.369529},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.366363},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.36574823},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.27525035},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.17553046},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.17135793},{"id":"https://openalex.org/C11276805","wikidata":"https://www.wikidata.org/wiki/Q771334","display_name":"Auction theory","level":3,"score":0.07819703},{"id":"https://openalex.org/C163239763","wikidata":"https://www.wikidata.org/wiki/Q5153637","display_name":"Common value auction","level":2,"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/C143684077","wikidata":"https://www.wikidata.org/wiki/Q431186","display_name":"Revenue equivalence","level":4,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1002/rsa.20578","pdf_url":null,"source":{"id":"https://openalex.org/S59667848","display_name":"Random Structures and Algorithms","issn_l":"1042-9832","issn":["1042-9832","1098-2418"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":18,"referenced_works":["https://openalex.org/W1569649260","https://openalex.org/W172574161","https://openalex.org/W1981020230","https://openalex.org/W2039995466","https://openalex.org/W2048652909","https://openalex.org/W2053616907","https://openalex.org/W2063911102","https://openalex.org/W2070099460","https://openalex.org/W2090359754","https://openalex.org/W2101079780","https://openalex.org/W2111559003","https://openalex.org/W2119312244","https://openalex.org/W2133352257","https://openalex.org/W2142702167","https://openalex.org/W2145192475","https://openalex.org/W2157529519","https://openalex.org/W2163768829","https://openalex.org/W3014094413"],"related_works":["https://openalex.org/W4232683556","https://openalex.org/W4205343173","https://openalex.org/W2949886028","https://openalex.org/W2523984912","https://openalex.org/W2373360128","https://openalex.org/W2290593817","https://openalex.org/W2184969544","https://openalex.org/W2108769166","https://openalex.org/W2053327019","https://openalex.org/W1547851544"],"abstract_inverted_index":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2153617527","counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":4},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-01-07T07:49:34.301877","created_date":"2016-06-24"}