{"id":"https://openalex.org/W4210447988","doi":"https://doi.org/10.1109/icoin53446.2022.9687193","title":"A Solution for Finding Quasi-Shortest Path with Graph Coarsening","display_name":"A Solution for Finding Quasi-Shortest Path with Graph Coarsening","publication_year":2022,"publication_date":"2022-01-12","ids":{"openalex":"https://openalex.org/W4210447988","doi":"https://doi.org/10.1109/icoin53446.2022.9687193"},"language":"en","primary_location":{"id":"doi:10.1109/icoin53446.2022.9687193","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icoin53446.2022.9687193","pdf_url":null,"source":{"id":"https://openalex.org/S4363608592","display_name":"2022 International Conference on Information Networking (ICOIN)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 International Conference on Information Networking (ICOIN)","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/A5041583032","display_name":"Takeaki Iwata","orcid":null},"institutions":[{"id":"https://openalex.org/I206011266","display_name":"Kwansei Gakuin University","ror":"https://ror.org/02qf2tx24","country_code":"JP","type":"education","lineage":["https://openalex.org/I206011266"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Takeaki Iwata","raw_affiliation_strings":["Graduate School of Science and Technology, Kwansei Gakuin University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Science and Technology, Kwansei Gakuin University","institution_ids":["https://openalex.org/I206011266"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012587116","display_name":"Keita Kitaura","orcid":null},"institutions":[{"id":"https://openalex.org/I206011266","display_name":"Kwansei Gakuin University","ror":"https://ror.org/02qf2tx24","country_code":"JP","type":"education","lineage":["https://openalex.org/I206011266"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Keita Kitaura","raw_affiliation_strings":["Graduate School of Science and Technology, Kwansei Gakuin University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Science and Technology, Kwansei Gakuin University","institution_ids":["https://openalex.org/I206011266"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112372365","display_name":"Ryotaro Matsuo","orcid":null},"institutions":[{"id":"https://openalex.org/I206011266","display_name":"Kwansei Gakuin University","ror":"https://ror.org/02qf2tx24","country_code":"JP","type":"education","lineage":["https://openalex.org/I206011266"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Ryotaro Matsuo","raw_affiliation_strings":["Graduate School of Science and Technology, Kwansei Gakuin University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Science and Technology, Kwansei Gakuin University","institution_ids":["https://openalex.org/I206011266"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018099452","display_name":"Hiroyuki Ohsaki","orcid":"https://orcid.org/0000-0003-0539-112X"},"institutions":[{"id":"https://openalex.org/I206011266","display_name":"Kwansei Gakuin University","ror":"https://ror.org/02qf2tx24","country_code":"JP","type":"education","lineage":["https://openalex.org/I206011266"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Hiroyuki Ohsaki","raw_affiliation_strings":["Graduate School of Science and Technology, Kwansei Gakuin University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Science and Technology, Kwansei Gakuin University","institution_ids":["https://openalex.org/I206011266"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I206011266"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.00610447,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"6","issue":null,"first_page":"215","last_page":"219"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9987999796867371,"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.9987999796867371,"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.9979000091552734,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.996999979019165,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6384265422821045},{"id":"https://openalex.org/keywords/block-graph","display_name":"Block graph","score":0.6225525140762329},{"id":"https://openalex.org/keywords/widest-path-problem","display_name":"Widest path problem","score":0.5587953925132751},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.557985246181488},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4902856647968292},{"id":"https://openalex.org/keywords/average-path-length","display_name":"Average path length","score":0.46715062856674194},{"id":"https://openalex.org/keywords/butterfly-graph","display_name":"Butterfly graph","score":0.441714882850647},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.42714279890060425},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4181944727897644},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3972817063331604},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.37891146540641785},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.36421269178390503},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.3592120409011841},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3218464255332947}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6384265422821045},{"id":"https://openalex.org/C43413943","wikidata":"https://www.wikidata.org/wiki/Q4927193","display_name":"Block graph","level":5,"score":0.6225525140762329},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.5587953925132751},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.557985246181488},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4902856647968292},{"id":"https://openalex.org/C91886571","wikidata":"https://www.wikidata.org/wiki/Q432520","display_name":"Average path length","level":4,"score":0.46715062856674194},{"id":"https://openalex.org/C18819970","wikidata":"https://www.wikidata.org/wiki/Q3035340","display_name":"Butterfly graph","level":5,"score":0.441714882850647},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.42714279890060425},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4181944727897644},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3972817063331604},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.37891146540641785},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36421269178390503},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.3592120409011841},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3218464255332947}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icoin53446.2022.9687193","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icoin53446.2022.9687193","pdf_url":null,"source":{"id":"https://openalex.org/S4363608592","display_name":"2022 International Conference on Information Networking (ICOIN)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 International Conference on Information Networking (ICOIN)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W169140825","https://openalex.org/W2008620264","https://openalex.org/W2070232376","https://openalex.org/W2084777082","https://openalex.org/W2118953734","https://openalex.org/W2135957668","https://openalex.org/W2138959470","https://openalex.org/W2169528473","https://openalex.org/W2169876669","https://openalex.org/W2233428269","https://openalex.org/W2794946269","https://openalex.org/W2962910558","https://openalex.org/W3008187376","https://openalex.org/W6847388455"],"related_works":["https://openalex.org/W2237480599","https://openalex.org/W1996697202","https://openalex.org/W2018146256","https://openalex.org/W94062305","https://openalex.org/W4210447988","https://openalex.org/W1497615776","https://openalex.org/W2375724183","https://openalex.org/W3109773082","https://openalex.org/W1804733508","https://openalex.org/W3041627257"],"abstract_inverted_index":{"In":[0,119],"recent":[1],"years,":[2],"different":[3,167],"types":[4],"of":[5,82,84,90,161],"large-scale":[6,19,31,51,91,154],"data":[7,85],"with":[8,50,128,166],"a":[9,74,124,133,153,179,194],"graph":[10,42,57,60,64,75,105,108,135,196,199],"structure,":[11],"such":[12,38,101],"as":[13,102],"communication":[14],"networks,":[15,17],"transportation":[16],"and":[18,26,59,107,186],"integrated":[20],"circuits,":[21],"are":[22,63],"being":[23],"commonly":[24],"used,":[25],"it":[27],"is":[28,200],"expected":[29],"that":[30,73,78,131,143,172],"graphs":[32,46,92],"will":[33],"be":[34,94],"used":[35],"to":[36,98,112,202],"represent":[37],"data.":[39],"However,":[40],"various":[41],"algorithms":[43],"for":[44,138],"analyzing":[45],"cannot":[47],"easily":[48],"deal":[49],"graphs.":[52,118],"To":[53],"solve":[54],"this":[55,120],"problem,":[56],"sparsification":[58],"coarsening,":[61],"which":[62],"mining":[65],"techniques,":[66],"have":[67],"been":[68],"actively":[69],"studied.":[70],"We":[71],"believe":[72],"coarsening":[76,129,136],"algorithm":[77,127,137],"reduces":[79],"the":[80,88,113,140,159,176,187,203],"number":[81],"dimensions":[83],"while":[86],"preserving":[87],"features":[89],"can":[93,174],"applied":[95],"not":[96],"only":[97],"complex":[99],"problems":[100],"node":[103],"clustering,":[104],"partitioning,":[106],"visualization":[109],"but":[110],"also":[111],"shortest":[114,147,204],"path":[115,126,148,178,189],"problem":[116],"on":[117],"study,":[121],"we":[122,157],"propose":[123],"quasi-shortest":[125,141,177,188],"(QSPC)":[130],"uses":[132],"typical":[134],"finding":[139],"path,":[142],"is,":[144],"an":[145],"approximate":[146],"between":[149,190],"two":[150,191],"vertices":[151,192],"in":[152,193],"graph.":[155],"Furthermore,":[156],"investigate":[158],"effectiveness":[160],"QSPC":[162,173],"through":[163],"several":[164],"experiments":[165],"scales.":[168],"Our":[169],"findings":[170],"indicate":[171],"find":[175],"constant":[180],"time":[181],"faster":[182],"than":[183],"Dijkstra\u2019s":[184],"algorithm,":[185],"tree":[195],"or":[197],"scale-free":[198],"equal":[201],"path.":[205]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}