{"id":"https://openalex.org/W958858891","doi":"https://doi.org/10.1007/978-3-319-05813-9_9","title":"Efficient Sampling Methods for Shortest Path Query over Uncertain Graphs","display_name":"Efficient Sampling Methods for Shortest Path Query over Uncertain Graphs","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W958858891","doi":"https://doi.org/10.1007/978-3-319-05813-9_9","mag":"958858891"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-05813-9_9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-05813-9_9","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":"book-chapter","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/A5058304306","display_name":"Yurong Cheng","orcid":"https://orcid.org/0000-0002-8696-9685"},"institutions":[{"id":"https://openalex.org/I9224756","display_name":"Northeastern University","ror":"https://ror.org/03awzbc87","country_code":"CN","type":"education","lineage":["https://openalex.org/I9224756"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Yurong Cheng","raw_affiliation_strings":["College of Information Science and Engineering, Northeastern University, China"],"affiliations":[{"raw_affiliation_string":"College of Information Science and Engineering, Northeastern University, China","institution_ids":["https://openalex.org/I9224756"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014346487","display_name":"Ye Yuan","orcid":"https://orcid.org/0000-0002-0247-9866"},"institutions":[{"id":"https://openalex.org/I9224756","display_name":"Northeastern University","ror":"https://ror.org/03awzbc87","country_code":"CN","type":"education","lineage":["https://openalex.org/I9224756"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ye Yuan","raw_affiliation_strings":["College of Information Science and Engineering, Northeastern University, China"],"affiliations":[{"raw_affiliation_string":"College of Information Science and Engineering, Northeastern University, China","institution_ids":["https://openalex.org/I9224756"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054991337","display_name":"Guoren Wang","orcid":"https://orcid.org/0000-0002-0181-8379"},"institutions":[{"id":"https://openalex.org/I9224756","display_name":"Northeastern University","ror":"https://ror.org/03awzbc87","country_code":"CN","type":"education","lineage":["https://openalex.org/I9224756"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Guoren Wang","raw_affiliation_strings":["College of Information Science and Engineering, Northeastern University, China"],"affiliations":[{"raw_affiliation_string":"College of Information Science and Engineering, Northeastern University, China","institution_ids":["https://openalex.org/I9224756"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102415968","display_name":"Baiyou Qiao","orcid":null},"institutions":[{"id":"https://openalex.org/I9224756","display_name":"Northeastern University","ror":"https://ror.org/03awzbc87","country_code":"CN","type":"education","lineage":["https://openalex.org/I9224756"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Baiyou Qiao","raw_affiliation_strings":["College of Information Science and Engineering, Northeastern University, China"],"affiliations":[{"raw_affiliation_string":"College of Information Science and Engineering, Northeastern University, China","institution_ids":["https://openalex.org/I9224756"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103215657","display_name":"Zhiqiong Wang","orcid":"https://orcid.org/0000-0002-0095-0378"},"institutions":[{"id":"https://openalex.org/I9224756","display_name":"Northeastern University","ror":"https://ror.org/03awzbc87","country_code":"CN","type":"education","lineage":["https://openalex.org/I9224756"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhiqiong Wang","raw_affiliation_strings":["College of Information Science and Engineering, Northeastern University, China"],"affiliations":[{"raw_affiliation_string":"College of Information Science and Engineering, Northeastern University, China","institution_ids":["https://openalex.org/I9224756"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5058304306"],"corresponding_institution_ids":["https://openalex.org/I9224756"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.4227,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.79637527,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"124","last_page":"140"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.9965999722480774,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9879000186920166,"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/computer-science","display_name":"Computer science","score":0.7723268270492554},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7190006971359253},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.5085383653640747},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4602339267730713},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.45660901069641113},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4395344853401184},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4084762930870056},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.32493412494659424}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7723268270492554},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7190006971359253},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.5085383653640747},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4602339267730713},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45660901069641113},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4395344853401184},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4084762930870056},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.32493412494659424}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-319-05813-9_9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-05813-9_9","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W16557529","https://openalex.org/W37148511","https://openalex.org/W1510148020","https://openalex.org/W1570856340","https://openalex.org/W1592142404","https://openalex.org/W1973968359","https://openalex.org/W1994924587","https://openalex.org/W1996936086","https://openalex.org/W2001743633","https://openalex.org/W2006097619","https://openalex.org/W2010780779","https://openalex.org/W2016049811","https://openalex.org/W2017694061","https://openalex.org/W2041361017","https://openalex.org/W2041916017","https://openalex.org/W2070261148","https://openalex.org/W2078446440","https://openalex.org/W2079007492","https://openalex.org/W2096304152","https://openalex.org/W2098636939","https://openalex.org/W2099083325","https://openalex.org/W2102842495","https://openalex.org/W2115826669","https://openalex.org/W2133457275","https://openalex.org/W2139694815","https://openalex.org/W2146128955","https://openalex.org/W2154356512","https://openalex.org/W2158269779","https://openalex.org/W2171901130","https://openalex.org/W2498260651","https://openalex.org/W2504074206","https://openalex.org/W2921756608","https://openalex.org/W3148930403","https://openalex.org/W4243551885"],"related_works":["https://openalex.org/W2776102956","https://openalex.org/W4382866750","https://openalex.org/W4293167680","https://openalex.org/W4387185483","https://openalex.org/W2018146256","https://openalex.org/W2022506245","https://openalex.org/W4399175858","https://openalex.org/W2040572217","https://openalex.org/W2388410942","https://openalex.org/W4385965963"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}