{"id":"https://openalex.org/W3080345935","doi":"https://doi.org/10.1145/3394486.3403061","title":"Efficient Algorithm for the b-Matching Graph","display_name":"Efficient Algorithm for the b-Matching Graph","publication_year":2020,"publication_date":"2020-08-20","ids":{"openalex":"https://openalex.org/W3080345935","doi":"https://doi.org/10.1145/3394486.3403061","mag":"3080345935"},"language":"en","primary_location":{"id":"doi:10.1145/3394486.3403061","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3394486.3403061","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining","raw_type":"proceedings-article"},"type":"conference-paper","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/A5101917967","display_name":"Yasuhiro Fujiwara","orcid":"https://orcid.org/0000-0001-9578-1118"},"institutions":[{"id":"https://openalex.org/I2251713219","display_name":"NTT (Japan)","ror":"https://ror.org/00berct97","country_code":"JP","type":"company","lineage":["https://openalex.org/I2251713219"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yasuhiro Fujiwara","raw_affiliation_strings":["NTT Communication Science Laboratories, Atugi-shi, Kanagawa, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NTT Communication Science Laboratories, Atugi-shi, Kanagawa, Japan","institution_ids":["https://openalex.org/I2251713219"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030880294","display_name":"Atsutoshi Kumagai","orcid":"https://orcid.org/0000-0002-2915-4615"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Atsutoshi Kumagai","raw_affiliation_strings":["NTT Software Innovation Center, Musashino-shi, Tokyo, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NTT Software Innovation Center, Musashino-shi, Tokyo, Japan","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010327448","display_name":"Sekitoshi Kanai","orcid":"https://orcid.org/0000-0003-4383-4454"},"institutions":[{"id":"https://openalex.org/I203951103","display_name":"Keio University","ror":"https://ror.org/02kn6nx58","country_code":"JP","type":"education","lineage":["https://openalex.org/I203951103"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Sekitoshi Kanai","raw_affiliation_strings":["NTT Software Innovation Center & Keio University, Musashino-shi, Tokyo, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NTT Software Innovation Center & Keio University, Musashino-shi, Tokyo, Japan","institution_ids":["https://openalex.org/I203951103"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086509276","display_name":"Yasutoshi Ida","orcid":"https://orcid.org/0000-0003-4279-9503"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yasutoshi Ida","raw_affiliation_strings":["NTT Software Innovation Center, Musashino-shi, Tokyo, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NTT Software Innovation Center, Musashino-shi, Tokyo, Japan","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5105268757","display_name":"Naonori Ueda","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Naonori Ueda","raw_affiliation_strings":["NTT Communication Science Laboratories, Seika-cho Soraku-gun, Kyoto, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NTT Communication Science Laboratories, Seika-cho Soraku-gun, Kyoto, Japan","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"187","last_page":"197"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.9980000257492065,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.996999979019165,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5906535387039185},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5324251055717468},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47598138451576233},{"id":"https://openalex.org/keywords/mixed-graph","display_name":"Mixed graph","score":0.47272056341171265},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4325799345970154},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.42020687460899353},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38538211584091187},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.3700059652328491},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29003286361694336},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.27746134996414185}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5906535387039185},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5324251055717468},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47598138451576233},{"id":"https://openalex.org/C53052385","wikidata":"https://www.wikidata.org/wiki/Q17104046","display_name":"Mixed graph","level":5,"score":0.47272056341171265},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4325799345970154},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.42020687460899353},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38538211584091187},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.3700059652328491},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29003286361694336},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.27746134996414185},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"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":[{"id":"doi:10.1145/3394486.3403061","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3394486.3403061","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1479807131","https://openalex.org/W1528845765","https://openalex.org/W1582701754","https://openalex.org/W1969357318","https://openalex.org/W1989320954","https://openalex.org/W1993962865","https://openalex.org/W1999848117","https://openalex.org/W2011809255","https://openalex.org/W2026667250","https://openalex.org/W2091746596","https://openalex.org/W2099352187","https://openalex.org/W2117756735","https://openalex.org/W2132914434","https://openalex.org/W2141923507","https://openalex.org/W2149580580","https://openalex.org/W2151090060","https://openalex.org/W2293426165","https://openalex.org/W2404720773","https://openalex.org/W2506128341","https://openalex.org/W2544746413","https://openalex.org/W2561368111","https://openalex.org/W2613065054","https://openalex.org/W2946046356","https://openalex.org/W3123554940","https://openalex.org/W4239172561"],"related_works":["https://openalex.org/W2186864281","https://openalex.org/W4255427455","https://openalex.org/W1966025497","https://openalex.org/W68941528","https://openalex.org/W4206451355","https://openalex.org/W1553604823","https://openalex.org/W8322802","https://openalex.org/W2362020254","https://openalex.org/W1493901008","https://openalex.org/W1963972604"],"abstract_inverted_index":{"The":[0,82],"b-matching":[1,41,83,102,159],"graph":[2,10,17,42,84,103,160],"is":[3,49,104,111,193],"a":[4,9,145,158],"useful":[5],"approach":[6,192],"to":[7,24,72,75,113,121,195],"computing":[8],"from":[11,64],"high-dimensional":[12,89],"data.":[13],"Unlike":[14],"the":[15,40,47,77,92,97,101,117,185,200],"k-NN":[16,94],"that":[18,54,190],"greedily":[19],"connects":[20],"each":[21,36,68,140],"data":[22,37,69,80,90,108,129,141],"point":[23,38,142],"its":[25,163],"k":[26,34],"nearest":[27],"neighbors":[28],"and":[29,133,176],"typically":[30],"has":[31,44],"more":[32,86],"than":[33,91,199],"edges,":[35],"in":[39,116,173],"uniformly":[43],"b":[45],"edges;":[46],"idea":[48],"reduce":[50],"edges":[51,115,175],"between":[52,125],"cross-clusters":[53],"have":[55],"different":[56],"semantics.":[57],"In":[58],"addition,":[59],"edge":[60,137,181],"weights":[61,138,182],"are":[62],"obtained":[63],"regression":[65],"results":[66],"of":[67,100,128,139,162],"pointand":[70],"restricted":[71],"be":[73],"non-negative":[74,136],"improve":[76],"robustness":[78],"for":[79,106,148],"noise.":[81],"can":[85,155],"effectively":[87],"model":[88],"traditional":[93],"graph.":[95],"However,":[96],"construction":[98],"cost":[99],"impractical":[105],"large-scale":[107],"sets.":[109],"This":[110],"because,":[112],"determine":[114],"graph,":[118],"it":[119,134,168,178],"needs":[120],"iteratively":[122],"update":[123,171],"messages":[124,172],"all":[126],"pairs":[127],"points":[130],"until":[131],"convergence,":[132],"computes":[135,180],"by":[143,183],"applying":[144],"solver":[146],"intended":[147],"quadratic":[149],"programming":[150],"problems.":[151],"Our":[152],"proposal,":[153],"b-dash,":[154],"efficiently":[156],"construct":[157],"because":[161],"two":[164],"key":[165],"techniques:":[166],"(1)":[167],"prunes":[169],"unnecessary":[170],"determining":[174],"(2)":[177],"incrementally":[179],"exploiting":[184],"Sherman-Morrison":[186],"formula.":[187],"Experiments":[188],"show":[189],"our":[191],"up":[194],"58.6":[196],"times":[197],"faster":[198],"previous":[201],"approaches":[202],"while":[203],"guaranteeing":[204],"result":[205],"optimality.":[206]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":3}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}