{"id":"https://openalex.org/W2131237536","doi":"https://doi.org/10.1109/tkde.2002.1033772","title":"An efficient path computation model for hierarchically structured topographical road maps","display_name":"An efficient path computation model for hierarchically structured topographical road maps","publication_year":2002,"publication_date":"2002-09-01","ids":{"openalex":"https://openalex.org/W2131237536","doi":"https://doi.org/10.1109/tkde.2002.1033772","mag":"2131237536"},"language":"en","primary_location":{"id":"doi:10.1109/tkde.2002.1033772","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tkde.2002.1033772","pdf_url":null,"source":{"id":"https://openalex.org/S30698027","display_name":"IEEE Transactions on Knowledge and Data Engineering","issn_l":"1041-4347","issn":["1041-4347","1558-2191","2326-3865"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Knowledge and Data Engineering","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/A5049458130","display_name":"Sungwon Jung","orcid":"https://orcid.org/0000-0002-5332-5947"},"institutions":[{"id":"https://openalex.org/I148751991","display_name":"Sogang University","ror":"https://ror.org/056tn4839","country_code":"KR","type":"education","lineage":["https://openalex.org/I148751991"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Sungwon Jung","raw_affiliation_strings":["Department of Computer Science, Sogang University, Seoul, South Korea"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Sogang University, Seoul, South Korea","institution_ids":["https://openalex.org/I148751991"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059755229","display_name":"Sakti Pramanik","orcid":null},"institutions":[{"id":"https://openalex.org/I87216513","display_name":"Michigan State University","ror":"https://ror.org/05hs6h993","country_code":"US","type":"education","lineage":["https://openalex.org/I87216513"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. Pramanik","raw_affiliation_strings":["Department of Computer Science, Michigan State University, East Lansing, MI, USA","Dept. of Comput. Sci., Michigan State Univ., East Lansing, MI, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Michigan State University, East Lansing, MI, USA","institution_ids":["https://openalex.org/I87216513"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Michigan State Univ., East Lansing, MI, USA","institution_ids":["https://openalex.org/I87216513"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5049458130"],"corresponding_institution_ids":["https://openalex.org/I148751991"],"apc_list":null,"apc_paid":null,"fwci":5.1892,"has_fulltext":false,"cited_by_count":225,"citation_normalized_percentile":{"value":0.9643286,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":100},"biblio":{"volume":"14","issue":"5","first_page":"1029","last_page":"1046"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9934999942779541,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T13282","display_name":"Automated Road and Building Extraction","score":0.974399983882904,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean 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/computer-science","display_name":"Computer science","score":0.7768895030021667},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6918742060661316},{"id":"https://openalex.org/keywords/structuring","display_name":"Structuring","score":0.6199718117713928},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6141212582588196},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6022598743438721},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.5629572868347168},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4891643822193146},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.47655871510505676},{"id":"https://openalex.org/keywords/widest-path-problem","display_name":"Widest path problem","score":0.47078651189804077},{"id":"https://openalex.org/keywords/lattice-graph","display_name":"Lattice graph","score":0.466418594121933},{"id":"https://openalex.org/keywords/graph-database","display_name":"Graph database","score":0.4220307171344757},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.38598811626434326},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3561190366744995},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14505505561828613},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.11483550071716309},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.08994680643081665},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.08420068025588989}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7768895030021667},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6918742060661316},{"id":"https://openalex.org/C2775945657","wikidata":"https://www.wikidata.org/wiki/Q381442","display_name":"Structuring","level":2,"score":0.6199718117713928},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6141212582588196},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6022598743438721},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.5629572868347168},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4891643822193146},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.47655871510505676},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.47078651189804077},{"id":"https://openalex.org/C145580432","wikidata":"https://www.wikidata.org/wiki/Q6497118","display_name":"Lattice graph","level":5,"score":0.466418594121933},{"id":"https://openalex.org/C176225458","wikidata":"https://www.wikidata.org/wiki/Q595971","display_name":"Graph database","level":3,"score":0.4220307171344757},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.38598811626434326},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3561190366744995},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14505505561828613},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.11483550071716309},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.08994680643081665},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.08420068025588989},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tkde.2002.1033772","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tkde.2002.1033772","pdf_url":null,"source":{"id":"https://openalex.org/S30698027","display_name":"IEEE Transactions on Knowledge and Data Engineering","issn_l":"1041-4347","issn":["1041-4347","1558-2191","2326-3865"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Knowledge and Data Engineering","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.6700000166893005,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":56,"referenced_works":["https://openalex.org/W144112274","https://openalex.org/W177721096","https://openalex.org/W1483143399","https://openalex.org/W1497617721","https://openalex.org/W1503149859","https://openalex.org/W1538399680","https://openalex.org/W1589685193","https://openalex.org/W1646038686","https://openalex.org/W1663018970","https://openalex.org/W1671881141","https://openalex.org/W1673383737","https://openalex.org/W1751356026","https://openalex.org/W1910272261","https://openalex.org/W1965109038","https://openalex.org/W1971470866","https://openalex.org/W1981627423","https://openalex.org/W1982180670","https://openalex.org/W1985324218","https://openalex.org/W1989111470","https://openalex.org/W1993504147","https://openalex.org/W1993901614","https://openalex.org/W2000987938","https://openalex.org/W2028750248","https://openalex.org/W2030267609","https://openalex.org/W2030874472","https://openalex.org/W2042078247","https://openalex.org/W2044040096","https://openalex.org/W2064083960","https://openalex.org/W2089692469","https://openalex.org/W2096035728","https://openalex.org/W2096725637","https://openalex.org/W2099624270","https://openalex.org/W2104586045","https://openalex.org/W2105576992","https://openalex.org/W2107409096","https://openalex.org/W2114734373","https://openalex.org/W2116407208","https://openalex.org/W2119430004","https://openalex.org/W2139954500","https://openalex.org/W2143676586","https://openalex.org/W2150521667","https://openalex.org/W2152377721","https://openalex.org/W2154356512","https://openalex.org/W2169910125","https://openalex.org/W2319958627","https://openalex.org/W2495528278","https://openalex.org/W2891523467","https://openalex.org/W3014033153","https://openalex.org/W3148413064","https://openalex.org/W4234142891","https://openalex.org/W4236538909","https://openalex.org/W4239596366","https://openalex.org/W4248112351","https://openalex.org/W6607262111","https://openalex.org/W6630140773","https://openalex.org/W6637382334"],"related_works":["https://openalex.org/W2375775343","https://openalex.org/W2018146256","https://openalex.org/W2198982833","https://openalex.org/W2365712669","https://openalex.org/W3205592527","https://openalex.org/W2612665926","https://openalex.org/W4294360851","https://openalex.org/W3183360588","https://openalex.org/W2577036349","https://openalex.org/W2131237536"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,122],"have":[4],"developed":[5],"a":[6,31,38,43,48,61,125],"HiTi":[7,27,57,104,119],"(Hierarchical":[8],"MulTi)":[9],"graph":[10,28,58,105,120],"model":[11,29,59],"for":[12,65,72,144],"structuring":[13,37],"large":[14],"topographical":[15,39,62],"road":[16,40,63],"maps":[17],"to":[18,34],"speed":[19],"up":[20],"the":[21,70,73,90,118,148],"minimum":[22],"cost":[23],"route":[24],"computation.":[25,67],"The":[26],"provides":[30,141],"novel":[32],"approach":[33],"abstracting":[35],"and":[36],"map":[41,64],"in":[42],"hierarchical":[44],"fashion.":[45],"We":[46,68,96],"propose":[47,124],"new":[49],"shortest":[50,127,138,151],"path":[51,128,139,152],"algorithm":[52,129],"named":[53,130],"SPAH,":[54],"which":[55],"utilizes":[56],"of":[60,75,80,103],"its":[66],"give":[69],"proof":[71],"optimality":[74],"SPAH.":[76],"Our":[77],"performance":[78],"analysis":[79,102],"SPAH":[81],"on":[82,114],"grid":[83,115],"graphs":[84],"showed":[85],"that":[86,135],"it":[87,109],"significantly":[88],"reduces":[89],"search":[91],"space":[92],"over":[93],"existing":[94],"methods.":[95],"also":[97,123],"present":[98],"an":[99],"in-depth":[100],"experimental":[101],"method":[106],"by":[107],"comparing":[108],"with":[110],"other":[111],"similar":[112],"works":[113],"graphs.":[116],"Within":[117],"framework,":[121],"parallel":[126],"ISPAH.":[131],"Experimental":[132],"results":[133],"show":[134],"inter":[136],"query":[137,150],"problem":[140],"more":[142],"opportunity":[143],"scalable":[145],"parallelism":[146],"than":[147],"intra":[149],"problem.":[153]},"counts_by_year":[{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":15},{"year":2016,"cited_by_count":14},{"year":2015,"cited_by_count":10},{"year":2014,"cited_by_count":12},{"year":2013,"cited_by_count":20},{"year":2012,"cited_by_count":18}],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2025-10-10T00:00:00"}