{"id":"https://openalex.org/W175307687","doi":null,"title":"Drawing Graphs to Speed Up Shortest-Path Computations.","display_name":"Drawing Graphs to Speed Up Shortest-Path Computations.","alternate_titles":[],"publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W175307687","mag":"175307687"},"language":"en","primary_location":{"id":"mag:175307687","doi":null,"is_oa":false,"landing_page_url":"http://www.siam.org/meetings/alenex05/papers/02d.wagner.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W175307687"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"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/A5045460793","display_name":"Dorothea Wagner","orcid":"https://orcid.org/0000-0002-9141-7076","observed_orcids":["https://orcid.org/0000-0002-9141-7076"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dorothea Wagner","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-9141-7076","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5010657180","display_name":"Thomas Willhalm","orcid":"https://orcid.org/0000-0001-8505-0936","observed_orcids":["https://orcid.org/0000-0001-8505-0936"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Thomas Willhalm","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-8505-0936","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.1591,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.92138198,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"17","last_page":"25"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.673799991607666,"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.673799991607666,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.2809999883174896,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.025599999353289604,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path","display_name":"shortest path","score":0.7860000133514404},{"id":"https://openalex.org/keywords/network-visualization","display_name":"network visualization","score":0.6669999957084656},{"id":"https://openalex.org/keywords/graph-layout","display_name":"graph layout","score":0.7870000004768372},{"id":"https://openalex.org/keywords/sparse-graphs","display_name":"sparse graphs","score":0.7139999866485596},{"id":"https://openalex.org/keywords/layout-algorithms","display_name":"layout algorithms","score":0.8339999914169312},{"id":"https://openalex.org/keywords/computational-speed-up","display_name":"computational speed-up","score":0.5830000042915344}],"concepts":[{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5383293628692627},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5298851728439331},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.480505108833313},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4748437702655792},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3578346371650696},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32981276512145996},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.32704925537109375},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.23334738612174988},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2173553705215454},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.13821804523468018}],"mesh":[],"locations_count":2,"locations":[{"id":"mag:175307687","doi":null,"is_oa":false,"landing_page_url":"http://www.siam.org/meetings/alenex05/papers/02d.wagner.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.69.6666","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.69.6666","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://i11www.informatik.uni-karlsruhe.de/algo/members/wagner/papers/ww-dgssc-05.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W79845460","https://openalex.org/W136556473","https://openalex.org/W247697463","https://openalex.org/W1530948733","https://openalex.org/W1561240874","https://openalex.org/W2000856020","https://openalex.org/W2008620264","https://openalex.org/W2011064024","https://openalex.org/W2014889099","https://openalex.org/W2044348081","https://openalex.org/W2075220720","https://openalex.org/W2100083479","https://openalex.org/W2101923813","https://openalex.org/W2103776069","https://openalex.org/W2109256116","https://openalex.org/W2112090702","https://openalex.org/W2138959470","https://openalex.org/W2158598102","https://openalex.org/W2167482691","https://openalex.org/W2168555292","https://openalex.org/W2169528473","https://openalex.org/W2338905098","https://openalex.org/W2594765389","https://openalex.org/W3022981850","https://openalex.org/W3029645440"],"related_works":["https://openalex.org/W2924923388","https://openalex.org/W7095873690","https://openalex.org/W2286127703","https://openalex.org/W7140188574","https://openalex.org/W2312368025","https://openalex.org/W6903955039","https://openalex.org/W2185114784","https://openalex.org/W2312755308","https://openalex.org/W3143514039","https://openalex.org/W7097729416"],"abstract_inverted_index":{"We":[0,71],"consider":[1],"the":[2,19,28,31,44,55,78],"problem":[3],"of":[4,22,30,43,80],"(repeatedly)":[5],"computing":[6],"singlesource":[7],"single-target":[8],"shortest":[9],"paths":[10],"in":[11,64],"large,":[12],"sparse":[13],"graphs.":[14],"Previous":[15],"investigations":[16],"have":[17],"shown":[18],"practical":[20],"usefulness":[21,79],"geometric":[23,58],"speed-up":[24,38,59,100],"techniques":[25,39,60],"that":[26,93],"guarantee":[27],"correctness":[29],"result":[32],"for":[33,87],"shortest-path":[34],"computations.":[35],"However,":[36],"such":[37,88],"utilize":[40],"a":[41,98],"layout":[42,69,96],"graph":[45,83],"which":[46],"typically":[47],"comes":[48],"from":[49,82],"geographic":[50],"information.":[51],"This":[52],"paper":[53],"examines":[54],"question":[56],"how":[57],"can":[61,101],"be":[62,102],"used":[63],"case":[65],"there":[66],"is":[67],"no":[68],"given.":[70],"present":[72],"an":[73],"extensive":[74],"computational":[75],"study":[76],"analyzing":[77],"methods":[81],"drawing":[84],"as":[85],"foundation":[86],"techniques.":[89],"It":[90],"turns":[91],"out":[92],"using":[94],"appropriate":[95],"algorithms,":[97],"significant":[99],"achieved.":[103]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W175307687","counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
