{"id":"https://openalex.org/W2354770748","doi":"https://doi.org/10.5220/0005859400420053","title":"The Spanning Tree based Approach for Solving the Shortest Path Problem in Social Graphs","display_name":"The Spanning Tree based Approach for Solving the Shortest Path Problem in Social Graphs","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2354770748","doi":"https://doi.org/10.5220/0005859400420053","mag":"2354770748"},"language":"en","primary_location":{"id":"doi:10.5220/0005859400420053","is_oa":true,"landing_page_url":"https://doi.org/10.5220/0005859400420053","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 12th International Conference on Web Information Systems and Technologies","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.5220/0005859400420053","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032545531","display_name":"Andrei Eremeev","orcid":null},"institutions":[{"id":"https://openalex.org/I173089394","display_name":"ITMO University","ror":"https://ror.org/04txgxn49","country_code":"RU","type":"education","lineage":["https://openalex.org/I173089394"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Andrei Eremeev","raw_affiliation_strings":["ITMO University, Russian Federation","Department of Computer Technologies, ITMO University, Saint Petersburg, Russia"],"affiliations":[{"raw_affiliation_string":"ITMO University, Russian Federation","institution_ids":["https://openalex.org/I173089394"]},{"raw_affiliation_string":"Department of Computer Technologies, ITMO University, Saint Petersburg, Russia","institution_ids":["https://openalex.org/I173089394"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064677880","display_name":"Georgiy Korneev","orcid":null},"institutions":[{"id":"https://openalex.org/I173089394","display_name":"ITMO University","ror":"https://ror.org/04txgxn49","country_code":"RU","type":"education","lineage":["https://openalex.org/I173089394"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Georgiy Korneev","raw_affiliation_strings":["ITMO University, Russian Federation","Department of Computer Technologies, ITMO University, Saint Petersburg, Russia"],"affiliations":[{"raw_affiliation_string":"ITMO University, Russian Federation","institution_ids":["https://openalex.org/I173089394"]},{"raw_affiliation_string":"Department of Computer Technologies, ITMO University, Saint Petersburg, Russia","institution_ids":["https://openalex.org/I173089394"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036491276","display_name":"Alexander Semenov","orcid":"https://orcid.org/0000-0003-2691-4575"},"institutions":[{"id":"https://openalex.org/I94722563","display_name":"University of Jyv\u00e4skyl\u00e4","ror":"https://ror.org/05n3dz165","country_code":"FI","type":"education","lineage":["https://openalex.org/I94722563"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Alexander Semenov","raw_affiliation_strings":["University of Jyvaskyla, Finland","Department of Compute Science and Information systems, University of Jyvaskyla, Jyvaskyla, Finland"],"affiliations":[{"raw_affiliation_string":"University of Jyvaskyla, Finland","institution_ids":["https://openalex.org/I94722563"]},{"raw_affiliation_string":"Department of Compute Science and Information systems, University of Jyvaskyla, Jyvaskyla, Finland","institution_ids":["https://openalex.org/I94722563"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056432204","display_name":"Jari Veijalainen","orcid":null},"institutions":[{"id":"https://openalex.org/I94722563","display_name":"University of Jyv\u00e4skyl\u00e4","ror":"https://ror.org/05n3dz165","country_code":"FI","type":"education","lineage":["https://openalex.org/I94722563"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Jari Veijalainen","raw_affiliation_strings":["University of Jyvaskyla, Finland","Department of Compute Science and Information systems, University of Jyvaskyla, Jyvaskyla, Finland"],"affiliations":[{"raw_affiliation_string":"University of Jyvaskyla, Finland","institution_ids":["https://openalex.org/I94722563"]},{"raw_affiliation_string":"Department of Compute Science and Information systems, University of Jyvaskyla, Jyvaskyla, Finland","institution_ids":["https://openalex.org/I94722563"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5032545531"],"corresponding_institution_ids":["https://openalex.org/I173089394"],"apc_list":null,"apc_paid":null,"fwci":0.2232,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.57318653,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"42","last_page":"53"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9961000084877014,"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/T10799","display_name":"Data Visualization and Analytics","score":0.9944000244140625,"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/shortest-path-problem","display_name":"Shortest path problem","score":0.8042488098144531},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7015571594238281},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5974714159965515},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.5710909366607666},{"id":"https://openalex.org/keywords/average-path-length","display_name":"Average path length","score":0.5676049590110779},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.4975447952747345},{"id":"https://openalex.org/keywords/widest-path-problem","display_name":"Widest path problem","score":0.47236329317092896},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.4686205983161926},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4643367528915405},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.43301260471343994},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3486200273036957},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32236120104789734},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2472563087940216},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.1573796272277832}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8042488098144531},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7015571594238281},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5974714159965515},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.5710909366607666},{"id":"https://openalex.org/C91886571","wikidata":"https://www.wikidata.org/wiki/Q432520","display_name":"Average path length","level":4,"score":0.5676049590110779},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.4975447952747345},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.47236329317092896},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.4686205983161926},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4643367528915405},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.43301260471343994},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3486200273036957},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32236120104789734},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2472563087940216},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.1573796272277832}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.5220/0005859400420053","is_oa":true,"landing_page_url":"https://doi.org/10.5220/0005859400420053","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 12th International Conference on Web Information Systems and Technologies","raw_type":"proceedings-article"},{"id":"pmh:oai:jyx.jyu.fi:123456789/49765","is_oa":true,"landing_page_url":"https://doi.org/10.5220/0005859400420053\"","pdf_url":"http://urn.fi/URN:NBN:fi:jyu-201605122519","source":{"id":"https://openalex.org/S4306400563","display_name":"Jyv\u00e4skyl\u00e4 University Digital Archive (University of Jyv\u00e4skyl\u00e4)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I94722563","host_organization_name":"University of Jyv\u00e4skyl\u00e4","host_organization_lineage":["https://openalex.org/I94722563"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"A4"},{"id":"pmh:oai:jyx.jyu.fi:123456789/49203","is_oa":false,"landing_page_url":"http://urn.fi/URN:NBN:fi:jyu-201603281950","pdf_url":null,"source":{"id":"https://openalex.org/S4306400563","display_name":"Jyv\u00e4skyl\u00e4 University Digital Archive (University of Jyv\u00e4skyl\u00e4)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I94722563","host_organization_name":"University of Jyv\u00e4skyl\u00e4","host_organization_lineage":["https://openalex.org/I94722563"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"G2"}],"best_oa_location":{"id":"doi:10.5220/0005859400420053","is_oa":true,"landing_page_url":"https://doi.org/10.5220/0005859400420053","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 12th International Conference on Web Information Systems and Technologies","raw_type":"proceedings-article"},"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.5899999737739563,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W328847996","https://openalex.org/W1512819151","https://openalex.org/W1679685803","https://openalex.org/W1893161742","https://openalex.org/W1976969221","https://openalex.org/W2047443612","https://openalex.org/W2148740744","https://openalex.org/W2153531029","https://openalex.org/W2165571577","https://openalex.org/W2178180590","https://openalex.org/W2799004609","https://openalex.org/W3111526966","https://openalex.org/W3122437804","https://openalex.org/W3145128584","https://openalex.org/W3148347080","https://openalex.org/W4236921317"],"related_works":["https://openalex.org/W2375775343","https://openalex.org/W2018146256","https://openalex.org/W2002764510","https://openalex.org/W2156431668","https://openalex.org/W2020255949","https://openalex.org/W2144050074","https://openalex.org/W2089338760","https://openalex.org/W2369379323","https://openalex.org/W2895697734","https://openalex.org/W2531277291"],"abstract_inverted_index":{"Nowadays":[0],"there":[1],"are":[2,58,81],"many":[3,59],"social":[4,16,37,85,99,117],"media":[5,17],"sites":[6,18,120],"with":[7,76,121,126],"a":[8,27,55],"very":[9],"large":[10,98],"number":[11],"of":[12,15,49,54,66,140,150],"users.":[13],"Users":[14],"and":[19,144],"relationships":[20],"between":[21,52],"them":[22,67],"can":[23,31],"be":[24,32],"modelled":[25],"as":[26],"graph.":[28,56],"Such":[29],"graphs":[30,79,118],"analysed":[33],"using":[34],"methods":[35],"from":[36,84],"network":[38,78],"analysis":[39],"(SNA).":[40],"Many":[41],"measures":[42],"used":[43],"in":[44,116],"SNA":[45],"rely":[46],"on":[47],"computation":[48],"shortest":[50,60,92,113],"paths":[51],"nodes":[53],"There":[57],"path":[61,93,114],"algorithms,":[62],"but":[63],"the":[64,105,112,141,151],"majority":[65],"suits":[68],"only":[69,75],"for":[70,97],"small":[71],"graphs,":[72],"or":[73],"work":[74],"road":[77],"that":[80],"fundamentally":[82],"different":[83],"graphs.":[86,100],"This":[87],"paper":[88],"describes":[89],"an":[90],"efficient":[91],"searching":[94],"algorithm":[95,103,110],"suitable":[96],"The":[101,108],"described":[102],"extends":[104],"Atlas":[106],"algorithm.":[107],"proposed":[109],"solves":[111],"problem":[115],"modelling":[119],"over":[122],"100":[123],"million":[124],"users":[125],"acceptable":[127],"response":[128],"time":[129],"(50":[130],"ms":[131],"per":[132],"query),":[133],"memory":[134],"usage":[135],"(less":[136],"than":[137,148],"15":[138],"GB":[139],"primary":[142],"memory)":[143],"applicable":[145],"accuracy":[146],"(higher":[147],"90%":[149],"queries":[152],"return":[153],"exact":[154],"result).":[155]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}