{"id":"https://openalex.org/W2002425594","doi":"https://doi.org/10.1145/1953102.1953108","title":"Applications of graph algorithms in GIS","display_name":"Applications of graph algorithms in GIS","publication_year":2010,"publication_date":"2010-11-01","ids":{"openalex":"https://openalex.org/W2002425594","doi":"https://doi.org/10.1145/1953102.1953108","mag":"2002425594"},"language":"en","primary_location":{"id":"doi:10.1145/1953102.1953108","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1953102.1953108","pdf_url":null,"source":{"id":"https://openalex.org/S27924493","display_name":"SIGSPATIAL Special","issn_l":"1946-7729","issn":["1946-7729"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIGSPATIAL Special","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://biblio.ugent.be/publication/1249762/file/1249764.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5013265303","display_name":"St\u00e9phanie Vanhove","orcid":null},"institutions":[{"id":"https://openalex.org/I32597200","display_name":"Ghent University","ror":"https://ror.org/00cv9y106","country_code":"BE","type":"education","lineage":["https://openalex.org/I32597200"]},{"id":"https://openalex.org/I2801227569","display_name":"Ghent University Hospital","ror":"https://ror.org/00xmkp704","country_code":"BE","type":"healthcare","lineage":["https://openalex.org/I2801227569"]}],"countries":["BE"],"is_corresponding":true,"raw_author_name":"St\u00e9phanie Vanhove","raw_affiliation_strings":["Ghent University, Ghent, Belgium","[Ghent University, Ghent, BeLgium]"],"affiliations":[{"raw_affiliation_string":"Ghent University, Ghent, Belgium","institution_ids":["https://openalex.org/I2801227569"]},{"raw_affiliation_string":"[Ghent University, Ghent, BeLgium]","institution_ids":["https://openalex.org/I32597200"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080512219","display_name":"Veerle Fack","orcid":"https://orcid.org/0000-0002-0662-7176"},"institutions":[{"id":"https://openalex.org/I32597200","display_name":"Ghent University","ror":"https://ror.org/00cv9y106","country_code":"BE","type":"education","lineage":["https://openalex.org/I32597200"]},{"id":"https://openalex.org/I2801227569","display_name":"Ghent University Hospital","ror":"https://ror.org/00xmkp704","country_code":"BE","type":"healthcare","lineage":["https://openalex.org/I2801227569"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Veerle Fack","raw_affiliation_strings":["Ghent University, Ghent, Belgium","[Ghent University, Ghent, BeLgium]"],"affiliations":[{"raw_affiliation_string":"Ghent University, Ghent, Belgium","institution_ids":["https://openalex.org/I2801227569"]},{"raw_affiliation_string":"[Ghent University, Ghent, BeLgium]","institution_ids":["https://openalex.org/I32597200"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5013265303"],"corresponding_institution_ids":["https://openalex.org/I2801227569","https://openalex.org/I32597200"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.08883668,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"2","issue":"3","first_page":"31","last_page":"36"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9994000196456909,"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.9994000196456909,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9767000079154968,"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"}},{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9697999954223633,"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/shortest-path-problem","display_name":"Shortest path problem","score":0.7762080430984497},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7739512920379639},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5399508476257324},{"id":"https://openalex.org/keywords/ranking","display_name":"Ranking (information retrieval)","score":0.5384822487831116},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5269321203231812},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.47831228375434875},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46810007095336914},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.45753103494644165},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4502815008163452},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34999775886535645},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1640331745147705},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14775162935256958}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7762080430984497},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7739512920379639},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5399508476257324},{"id":"https://openalex.org/C189430467","wikidata":"https://www.wikidata.org/wiki/Q7293293","display_name":"Ranking (information retrieval)","level":2,"score":0.5384822487831116},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5269321203231812},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.47831228375434875},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46810007095336914},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.45753103494644165},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4502815008163452},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34999775886535645},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1640331745147705},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14775162935256958},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1953102.1953108","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1953102.1953108","pdf_url":null,"source":{"id":"https://openalex.org/S27924493","display_name":"SIGSPATIAL Special","issn_l":"1946-7729","issn":["1946-7729"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIGSPATIAL Special","raw_type":"journal-article"},{"id":"pmh:oai:archive.ugent.be:1249762","is_oa":true,"landing_page_url":"http://hdl.handle.net/1854/LU-1249762","pdf_url":"https://biblio.ugent.be/publication/1249762/file/1249764.pdf","source":{"id":"https://openalex.org/S4306400478","display_name":"Ghent University Academic Bibliography (Ghent University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I32597200","host_organization_name":"Ghent University","host_organization_lineage":["https://openalex.org/I32597200"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN: 1946-7729","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:archive.ugent.be:1249762","is_oa":true,"landing_page_url":"http://hdl.handle.net/1854/LU-1249762","pdf_url":"https://biblio.ugent.be/publication/1249762/file/1249764.pdf","source":{"id":"https://openalex.org/S4306400478","display_name":"Ghent University Academic Bibliography (Ghent University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I32597200","host_organization_name":"Ghent University","host_organization_lineage":["https://openalex.org/I32597200"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN: 1946-7729","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.5400000214576721,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321730","display_name":"Fonds Wetenschappelijk Onderzoek","ror":"https://ror.org/03qtxy027"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2002425594.pdf","grobid_xml":"https://content.openalex.org/works/W2002425594.grobid-xml"},"referenced_works_count":10,"referenced_works":["https://openalex.org/W1482690689","https://openalex.org/W1969553592","https://openalex.org/W1970543907","https://openalex.org/W1991924366","https://openalex.org/W2011282943","https://openalex.org/W2020147819","https://openalex.org/W2050590009","https://openalex.org/W2094099891","https://openalex.org/W2169528473","https://openalex.org/W2277605219"],"related_works":["https://openalex.org/W2188500270","https://openalex.org/W2303858293","https://openalex.org/W2798198862","https://openalex.org/W2915512527","https://openalex.org/W51364034","https://openalex.org/W2798997222","https://openalex.org/W2793336762","https://openalex.org/W2091548507","https://openalex.org/W2368816706","https://openalex.org/W3159414774"],"abstract_inverted_index":{"This":[0,100],"paper":[1],"describes":[2],"ongoing":[3],"PhD":[4],"research":[5,35],"on":[6],"applications":[7],"of":[8,29,46,83,97,113],"graph":[9,23],"algorithms":[10,54],"in":[11,26,31,61,65],"Geographical":[12],"Information":[13],"Systems.":[14],"Many":[15],"GIS":[16],"problems":[17],"can":[18,101],"be":[19,76,102],"translated":[20],"into":[21,78],"a":[22,66,105,111],"problem,":[24,109],"especially":[25],"the":[27,47,95,121],"domain":[28],"routing":[30,48],"road":[32,62],"networks.":[33],"Our":[34],"aims":[36],"to":[37,75],"evaluate":[38],"and":[39,71,135],"develop":[40],"efficient":[41],"methods":[42,85],"for":[43,59,86,129],"different":[44,84],"variants":[45],"problem.":[49],"Standard":[50],"existing":[51],"shortest":[52,107,122],"path":[53,123],"are":[55],"not":[56],"always":[57],"suited":[58],"use":[60],"networks,":[63],"e.g.":[64],"realistic":[67],"situation":[68],"forbidden":[69],"turns":[70],"turn":[72],"penalties":[73],"need":[74],"taken":[77],"account.":[79],"An":[80],"experimental":[81],"evaluation":[82],"this":[87],"purpose":[88],"is":[89,94,116,133],"presented.":[90],"Another":[91],"interesting":[92],"problem":[93],"generation":[96],"alternative":[98,131],"routes.":[99],"modelled":[103],"as":[104],"k":[106,114],"paths":[108,115],"where":[110],"ranking":[112],"desired":[117],"rather":[118],"than":[119],"only":[120],"itself.":[124],"A":[125],"new":[126],"heuristic":[127],"approach":[128],"generating":[130],"routes":[132],"presented":[134],"evaluated.":[136]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}