{"id":"https://openalex.org/W2145479198","doi":"https://doi.org/10.1017/s0963548306007802","title":"Size and Weight of Shortest Path Trees with Exponential Link Weights","display_name":"Size and Weight of Shortest Path Trees with Exponential Link Weights","publication_year":2006,"publication_date":"2006-08-15","ids":{"openalex":"https://openalex.org/W2145479198","doi":"https://doi.org/10.1017/s0963548306007802","mag":"2145479198"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548306007802","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548306007802","pdf_url":null,"source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","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/A5034587660","display_name":"Remco van der Hofstad","orcid":"https://orcid.org/0000-0003-1331-9697"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"REMCO VAN DER HOFSTAD","raw_affiliation_strings":["Department of Mathematics and Computer Science, Eindhoven University of Technology, PO Box 513, 5600 MB Eindhoven, The Netherlands (e-mail:","Department of Mathematics and Computer Science, Eindhoven University of Technology, PO Box 513, 5600 MB Eindhoven, The Netherlands (e-mail: rhofstad@win.tue.nl)#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Eindhoven University of Technology, PO Box 513, 5600 MB Eindhoven, The Netherlands (e-mail:","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"Department of Mathematics and Computer Science, Eindhoven University of Technology, PO Box 513, 5600 MB Eindhoven, The Netherlands (e-mail: rhofstad@win.tue.nl)#TAB#","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077651434","display_name":"Gerard Hooghiemstra","orcid":null},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"GERARD HOOGHIEMSTRA","raw_affiliation_strings":["Electrical Engineering, Mathematics and Computer Science, Delft University of Technology, PO Box 5031, 2600 GA Delft, The Netherlands (e-mail:","Electrical Engineering, Mathematics and Computer Science, Delft University of Technology, PO Box 5031, 2600 GA Delft, The Netherlands (e-mail: G.Hooghiemstra@ewi.tudelft.nl and P.VanMieghem@ewi.tu "],"affiliations":[{"raw_affiliation_string":"Electrical Engineering, Mathematics and Computer Science, Delft University of Technology, PO Box 5031, 2600 GA Delft, The Netherlands (e-mail:","institution_ids":["https://openalex.org/I98358874"]},{"raw_affiliation_string":"Electrical Engineering, Mathematics and Computer Science, Delft University of Technology, PO Box 5031, 2600 GA Delft, The Netherlands (e-mail: G.Hooghiemstra@ewi.tudelft.nl and P.VanMieghem@ewi.tu ","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001877366","display_name":"Piet Van Mieghem","orcid":"https://orcid.org/0000-0002-3786-7922"},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"PIET VAN MIEGHEM","raw_affiliation_strings":["Electrical Engineering, Mathematics and Computer Science, Delft University of Technology, PO Box 5031, 2600 GA Delft, The Netherlands (e-mail:","Electrical Engineering, Mathematics and Computer Science, Delft University of Technology, PO Box 5031, 2600 GA Delft, The Netherlands (e-mail: G.Hooghiemstra@ewi.tudelft.nl and P.VanMieghem@ewi.tu "],"affiliations":[{"raw_affiliation_string":"Electrical Engineering, Mathematics and Computer Science, Delft University of Technology, PO Box 5031, 2600 GA Delft, The Netherlands (e-mail:","institution_ids":["https://openalex.org/I98358874"]},{"raw_affiliation_string":"Electrical Engineering, Mathematics and Computer Science, Delft University of Technology, PO Box 5031, 2600 GA Delft, The Netherlands (e-mail: G.Hooghiemstra@ewi.tudelft.nl and P.VanMieghem@ewi.tu ","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5034587660"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":null,"apc_paid":null,"fwci":3.4057,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":{"value":0.92877553,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"15","issue":"6","first_page":"903","last_page":"926"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11476","display_name":"Graph theory and applications","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11476","display_name":"Graph theory and applications","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994000196456909,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9979000091552734,"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/link","display_name":"Link (geometry)","score":0.7339649796485901},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7106019854545593},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.6603326201438904},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6210364699363708},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5835415124893188},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5748467445373535},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5177411437034607},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.4852418899536133},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3724820017814636},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.24812102317810059},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.11229410767555237},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1121092140674591},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.09874770045280457},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.0774068832397461}],"concepts":[{"id":"https://openalex.org/C2778753846","wikidata":"https://www.wikidata.org/wiki/Q6554239","display_name":"Link (geometry)","level":2,"score":0.7339649796485901},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7106019854545593},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6603326201438904},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6210364699363708},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5835415124893188},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5748467445373535},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5177411437034607},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.4852418899536133},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3724820017814636},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.24812102317810059},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.11229410767555237},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1121092140674591},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.09874770045280457},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0774068832397461},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1017/s0963548306007802","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548306007802","pdf_url":null,"source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:publications/097e961f-e653-4123-b37c-29fc978c2bd1","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/097e961f-e653-4123-b37c-29fc978c2bd1","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Hofstad, van der, R W, Hooghiemstra, G & Van Mieghem, P 2006, 'Size and weight of shortest path trees with exponential link weights', Combinatorics, Probability and Computing, vol. 15, no. 6, pp. 903-926. https://doi.org/10.1017/S0963548306007802","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:tudelft.nl:uuid:770ba306-4542-4056-b905-01821a8c6597","is_oa":false,"landing_page_url":"http://resolver.tudelft.nl/uuid:770ba306-4542-4056-b905-01821a8c6597","pdf_url":null,"source":{"id":"https://openalex.org/S4306400906","display_name":"Research Repository (Delft University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98358874","host_organization_name":"Delft University of Technology","host_organization_lineage":["https://openalex.org/I98358874"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"conference paper"},{"id":"pmh:tue:oai:pure.tue.nl:publications/097e961f-e653-4123-b37c-29fc978c2bd1","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/097e961f-e653-4123-b37c-29fc978c2bd1","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Combinatorics, Probability and Computing, 15(6), 903 - 926. Cambridge University Press","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W55191700","https://openalex.org/W100926944","https://openalex.org/W604181985","https://openalex.org/W1483717185","https://openalex.org/W1497283712","https://openalex.org/W1516806406","https://openalex.org/W1562224100","https://openalex.org/W1976969221","https://openalex.org/W1991701390","https://openalex.org/W1996753220","https://openalex.org/W2031541804","https://openalex.org/W2042492403","https://openalex.org/W2051213257","https://openalex.org/W2054812794","https://openalex.org/W2059014957","https://openalex.org/W2119118866","https://openalex.org/W2120062331","https://openalex.org/W2123018954","https://openalex.org/W2127932081","https://openalex.org/W2131739995","https://openalex.org/W2138146164","https://openalex.org/W2140113759","https://openalex.org/W2149871165","https://openalex.org/W2155830639","https://openalex.org/W2157005274","https://openalex.org/W2167274780","https://openalex.org/W2905110430","https://openalex.org/W2990144398"],"related_works":["https://openalex.org/W1518185400","https://openalex.org/W3200586296","https://openalex.org/W4230332972","https://openalex.org/W1998033311","https://openalex.org/W4247322236","https://openalex.org/W4231165741","https://openalex.org/W233457313","https://openalex.org/W4295104149","https://openalex.org/W1762272577","https://openalex.org/W1985727224"],"abstract_inverted_index":{"We":[0,26],"derive":[1],"the":[2,5,10,14,32,36],"distribution":[3],"of":[4,7,35],"number":[6],"links":[8],"and":[9],"average":[11,33],"weight":[12,34],"for":[13,31],"shortest":[15],"path":[16],"tree":[17],"(SPT)":[18],"rooted":[19],"at":[20],"an":[21],"arbitrary":[22],"node":[23],"to":[24],".":[25],"also":[27],"obtain":[28],"exact":[29],"expressions":[30],"subtree.":[37]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-03-28T08:17:26.163206","created_date":"2025-10-10T00:00:00"}