{"id":"https://openalex.org/W2171769876","doi":"https://doi.org/10.1017/s0963548309990204","title":"The Longest Minimum-Weight Path in a Complete Graph","display_name":"The Longest Minimum-Weight Path in a Complete Graph","publication_year":2009,"publication_date":"2009-06-22","ids":{"openalex":"https://openalex.org/W2171769876","doi":"https://doi.org/10.1017/s0963548309990204","mag":"2171769876"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548309990204","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548309990204","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/A5085128089","display_name":"Louigi Addario\u2010Berry","orcid":"https://orcid.org/0000-0001-7125-5746"},"institutions":[{"id":"https://openalex.org/I70931966","display_name":"Universit\u00e9 de Montr\u00e9al","ror":"https://ror.org/0161xgx34","country_code":"CA","type":"education","lineage":["https://openalex.org/I70931966"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"LOUIGI ADDARIO-BERRY","raw_affiliation_strings":["D\u00e9partement de Math\u00e9matiques et de Statistique, Universit\u00e9 de Montr\u00e9al, CP 6128, Succ. Centre-ville, Montreal, Quebec, H3C 3J7, Canada (e-mail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"D\u00e9partement de Math\u00e9matiques et de Statistique, Universit\u00e9 de Montr\u00e9al, CP 6128, Succ. Centre-ville, Montreal, Quebec, H3C 3J7, Canada (e-mail:","institution_ids":["https://openalex.org/I70931966"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068016630","display_name":"Nicolas Broutin","orcid":null},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"NICOLAS BROUTIN","raw_affiliation_strings":["Projet Algorithms, INRIA Rocquencourt, 78153 Le Chesnay, France (e-mail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Projet Algorithms, INRIA Rocquencourt, 78153 Le Chesnay, France (e-mail:","institution_ids":["https://openalex.org/I1326498283"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034680608","display_name":"G\u00e1bor Lugosi","orcid":"https://orcid.org/0000-0003-1614-5901"},"institutions":[{"id":"https://openalex.org/I170486558","display_name":"Universitat Pompeu Fabra","ror":"https://ror.org/04n0g0b29","country_code":"ES","type":"education","lineage":["https://openalex.org/I170486558"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"G\u00c1BOR LUGOSI","raw_affiliation_strings":["Department of Economics, Pompeu Fabra University, Ramon Trias Fargas 25-27, 08005, Barcelona, Spain (e-mail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Economics, Pompeu Fabra University, Ramon Trias Fargas 25-27, 08005, Barcelona, Spain (e-mail:","institution_ids":["https://openalex.org/I170486558"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5085128089"],"corresponding_institution_ids":["https://openalex.org/I70931966"],"apc_list":null,"apc_paid":null,"fwci":1.418,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.82817421,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"19","issue":"1","first_page":"1","last_page":"19"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991999864578247,"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.9991999864578247,"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/T11152","display_name":"Stochastic processes and statistical mechanics","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9970999956130981,"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/combinatorics","display_name":"Combinatorics","score":0.7199917435646057},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6194038391113281},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5981255769729614},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5909115076065063},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.5615388751029968},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5177627801895142},{"id":"https://openalex.org/keywords/path-length","display_name":"Path length","score":0.42409518361091614},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.41900497674942017},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38734811544418335},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.19006147980690002}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7199917435646057},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6194038391113281},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5981255769729614},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5909115076065063},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.5615388751029968},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5177627801895142},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.42409518361091614},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.41900497674942017},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38734811544418335},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.19006147980690002},{"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.1017/s0963548309990204","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548309990204","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:CiteSeerX.psu:10.1.1.143.4078","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.143.4078","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.econ.upf.es/~lugosi/jansonpaths.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W2008048984","https://openalex.org/W2031541804","https://openalex.org/W2034681107","https://openalex.org/W2081715952","https://openalex.org/W2097612342","https://openalex.org/W2107808918","https://openalex.org/W2113575907","https://openalex.org/W2130956934","https://openalex.org/W2139815643","https://openalex.org/W2145479198","https://openalex.org/W2152197249","https://openalex.org/W2289647522","https://openalex.org/W2496163386","https://openalex.org/W2796425996","https://openalex.org/W4211165101","https://openalex.org/W4240666298","https://openalex.org/W4249197767","https://openalex.org/W4250226066","https://openalex.org/W4301258660","https://openalex.org/W4301463559"],"related_works":["https://openalex.org/W2904724461","https://openalex.org/W4283320317","https://openalex.org/W1837539276","https://openalex.org/W2963380004","https://openalex.org/W4205243275","https://openalex.org/W4285057345","https://openalex.org/W2939308293","https://openalex.org/W2060569445","https://openalex.org/W3125176605","https://openalex.org/W2951635661"],"abstract_inverted_index":{"We":[0,29],"consider":[1],"the":[2,11,18,21,32,49,53],"minimum-weight":[3,36],"path":[4],"between":[5],"any":[6],"pair":[7],"of":[8,10,20,34,52],"nodes":[9],"n":[12,42],"-vertex":[13],"complete":[14],"graph":[15],"in":[16],"which":[17],"weights":[19],"edges":[22],"are":[23],"i.i.d.":[24],"exponentially":[25],"distributed":[26],"random":[27],"variables.":[28],"show":[30],"that":[31],"longest":[33],"these":[35],"paths":[37],"has":[38],"about":[39],"\u03b1*":[40,45],"log":[41,56],"edges,":[43],"where":[44],"\u2248":[46],"3.5911":[47],"is":[48],"unique":[50],"solution":[51],"equation":[54],"\u03b1":[55,57,59],"\u2212":[58],"=":[60],"1.":[61],"This":[62],"answers":[63],"a":[64],"question":[65],"posed":[66],"by":[67],"Janson":[68],"[8].":[69]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}