{"id":"https://openalex.org/W2344344684","doi":null,"title":"Computing the Stochastic Shortest Path Length Between Two Vertices with Exponentially Distributed Edge Lengths in Graphs with Small Treewidth","display_name":"Computing the Stochastic Shortest Path Length Between Two Vertices with Exponentially Distributed Edge Lengths in Graphs with Small Treewidth","publication_year":2012,"publication_date":"2012-03-09","ids":{"openalex":"https://openalex.org/W2344344684","mag":"2344344684"},"language":"en","primary_location":{"id":"mag:2344344684","doi":null,"is_oa":false,"landing_page_url":"http://ci.nii.ac.jp/naid/110009546100","pdf_url":null,"source":{"id":"https://openalex.org/S4210197683","display_name":"Medical Entomology and Zoology","issn_l":"0424-7086","issn":["0424-7086","2185-5609"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310319750","host_organization_name":"Japan Society of Medical Entomology and Zoology","host_organization_lineage":["https://openalex.org/P4310319750"],"host_organization_lineage_names":["Japan Society of Medical Entomology and Zoology"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"IEICE technical report. Theoretical foundations of Computing","raw_type":null},"volume":null,"type":"article","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/A5049609773","display_name":"Ei Ando","orcid":"https://orcid.org/0000-0001-7284-9896","observed_orcids":["https://orcid.org/0000-0001-7284-9896"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ei Ando","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-7284-9896","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5068585777","display_name":"Joseph G. Peters","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Joseph G. Peters","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.20612675,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"111","issue":"494","first_page":"23","last_page":"29"},"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.9800000190734863,"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.9800000190734863,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.016499999910593033,"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.000699999975040555,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/stochastic-shortest-path","display_name":"stochastic shortest path","score":0.9200000166893005},{"id":"https://openalex.org/keywords/shortest-path-length","display_name":"shortest path length","score":0.7260000109672546},{"id":"https://openalex.org/keywords/treewidth","display_name":"treewidth","score":0.6899999976158142},{"id":"https://openalex.org/keywords/random-graphs","display_name":"random graphs","score":0.5770000219345093},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"graph algorithms","score":0.3540000021457672}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.7800375819206238},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.608147144317627},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.557162344455719},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.5264428853988647},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4650484323501587},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.46047937870025635},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.45625409483909607},{"id":"https://openalex.org/C75235859","wikidata":"https://www.wikidata.org/wiki/Q582659","display_name":"Exponential growth","level":2,"score":0.43803995847702026},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.4348812699317932},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.4315575361251831},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3843719959259033},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.30581051111221313},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2359972596168518},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.06870913505554199},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.06569543480873108},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.06368222832679749},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","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}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2344344684","doi":null,"is_oa":false,"landing_page_url":"http://ci.nii.ac.jp/naid/110009546100","pdf_url":null,"source":{"id":"https://openalex.org/S4210197683","display_name":"Medical Entomology and Zoology","issn_l":"0424-7086","issn":["0424-7086","2185-5609"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310319750","host_organization_name":"Japan Society of Medical Entomology and Zoology","host_organization_lineage":["https://openalex.org/P4310319750"],"host_organization_lineage_names":["Japan Society of Medical Entomology and Zoology"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"IEICE technical report. Theoretical foundations of Computing","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1817899449","https://openalex.org/W2095941092","https://openalex.org/W2006385089","https://openalex.org/W2736310117","https://openalex.org/W1480502458","https://openalex.org/W2071324569","https://openalex.org/W267514296","https://openalex.org/W197854957","https://openalex.org/W1980627447","https://openalex.org/W2803530067","https://openalex.org/W1493370921","https://openalex.org/W1496194573","https://openalex.org/W1965147690","https://openalex.org/W1480718878","https://openalex.org/W2075543862","https://openalex.org/W2008034501","https://openalex.org/W2059534468","https://openalex.org/W2768149714","https://openalex.org/W106250353","https://openalex.org/W1497433128"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2025-10-10T00:00:00"}