{"id":"https://openalex.org/W1584607632","doi":"https://doi.org/10.1007/978-3-540-92182-0_67","title":"Computing Best and Worst Shortcuts of Graphs Embedded in Metric Spaces","display_name":"Computing Best and Worst Shortcuts of Graphs Embedded in Metric Spaces","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W1584607632","doi":"https://doi.org/10.1007/978-3-540-92182-0_67","mag":"1584607632"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-92182-0_67","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-92182-0_67","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"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/A5103584527","display_name":"Jun Luo","orcid":null},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Jun Luo","raw_affiliation_strings":["Department of Information and Computing Sciences, Universiteit Utrecht, Centrumgebouw Noord, office A210, Padualaan 14, De Uithof, 3584CH, Utrecht, The Netherlands","Department of Information and Computing Sciences, Universiteit Utrecht, Centrumgebouw Noord, Utrecht, The Netherlands 3584CH#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information and Computing Sciences, Universiteit Utrecht, Centrumgebouw Noord, office A210, Padualaan 14, De Uithof, 3584CH, Utrecht, The Netherlands","institution_ids":["https://openalex.org/I193662353"]},{"raw_affiliation_string":"Department of Information and Computing Sciences, Universiteit Utrecht, Centrumgebouw Noord, Utrecht, The Netherlands 3584CH#TAB#","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077977985","display_name":"Christian Wulff\u2010Nilsen","orcid":"https://orcid.org/0000-0002-3699-7821"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Christian Wulff-Nilsen","raw_affiliation_strings":["Department of Computer Science, University of Copenhagen, Universitetsparken 1, DK-2100, Copenhagen O, Denmark","Department of Computer Science, University of Copenhagen, Copenhagen \u00d8, Denmark DK-2100#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Copenhagen, Universitetsparken 1, DK-2100, Copenhagen O, Denmark","institution_ids":["https://openalex.org/I124055696"]},{"raw_affiliation_string":"Department of Computer Science, University of Copenhagen, Copenhagen \u00d8, Denmark DK-2100#TAB#","institution_ids":["https://openalex.org/I124055696"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.857,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.67223673,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"764","last_page":"775"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9984999895095825,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9984999895095825,"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.9980999827384949,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9976000189781189,"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/combinatorics","display_name":"Combinatorics","score":0.6992024183273315},{"id":"https://openalex.org/keywords/metric-space","display_name":"Metric space","score":0.5701305866241455},{"id":"https://openalex.org/keywords/path-graph","display_name":"Path graph","score":0.5314653515815735},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5071332454681396},{"id":"https://openalex.org/keywords/linear-space","display_name":"Linear space","score":0.505831241607666},{"id":"https://openalex.org/keywords/dilation","display_name":"Dilation (metric space)","score":0.5034770369529724},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5000035762786865},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4956871271133423},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4829384684562683},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46206387877464294},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4522070586681366},{"id":"https://openalex.org/keywords/connectivity","display_name":"Connectivity","score":0.44999751448631287},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.37390440702438354},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.23437976837158203},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.19789442420005798}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6992024183273315},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.5701305866241455},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.5314653515815735},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5071332454681396},{"id":"https://openalex.org/C176370821","wikidata":"https://www.wikidata.org/wiki/Q1826459","display_name":"Linear space","level":2,"score":0.505831241607666},{"id":"https://openalex.org/C2780757906","wikidata":"https://www.wikidata.org/wiki/Q5276676","display_name":"Dilation (metric space)","level":2,"score":0.5034770369529724},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5000035762786865},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4956871271133423},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4829384684562683},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46206387877464294},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4522070586681366},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.44999751448631287},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37390440702438354},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.23437976837158203},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.19789442420005798}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-540-92182-0_67","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-92182-0_67","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/1c2bc250-de51-11dd-b5fc-000ea68e967b","is_oa":false,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/1c2bc250-de51-11dd-b5fc-000ea68e967b","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Wulff-Nilsen , C & Luo , J 2008 , Computing Best and Worst Shortcuts of Graphs Embedded in Metric Spaces . in S-H Hong , H Nagamochi & T Fukunaga (eds) , Algorithms and Computation : 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008, Proceedings . Springer , Lecture notes in computer science , no. 5369 , pp. 764-775 , International Symposium on Algorithms and Computation , Gold Coast , Australia , 15/12/2008 . https://doi.org/10.1007/978-3-540-92182-0_67","raw_type":"contributionToPeriodical"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1505970908","https://openalex.org/W1552092932","https://openalex.org/W1555007779","https://openalex.org/W1555471913","https://openalex.org/W2048557227","https://openalex.org/W2152290683","https://openalex.org/W2220384749"],"related_works":["https://openalex.org/W2147332298","https://openalex.org/W4303985972","https://openalex.org/W2039832814","https://openalex.org/W4299976271","https://openalex.org/W2786830943","https://openalex.org/W2085846262","https://openalex.org/W2035507719","https://openalex.org/W1495730785","https://openalex.org/W2963551218","https://openalex.org/W2064527490"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-08-04T08:18:43.703281","created_date":"2025-10-10T00:00:00"}