{"id":"https://openalex.org/W2993536552","doi":"https://doi.org/10.18287/1613-0073-2019-2416-368-375","title":"Methods for finding shortest paths on graphs in organizational and economic systems and their implementation","display_name":"Methods for finding shortest paths on graphs in organizational and economic systems and their implementation","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2993536552","doi":"https://doi.org/10.18287/1613-0073-2019-2416-368-375","mag":"2993536552"},"language":"en","primary_location":{"id":"doi:10.18287/1613-0073-2019-2416-368-375","doi":"https://doi.org/10.18287/1613-0073-2019-2416-368-375","is_oa":true,"landing_page_url":"https://doi.org/10.18287/1613-0073-2019-2416-368-375","pdf_url":"https://doi.org/10.18287/1613-0073-2019-2416-368-375","source":{"id":"https://openalex.org/S4363607880","display_name":"International Conference on Information Technology and Nanotechnology (ITNT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the V International conference Information Technology and Nanotechnology 2019","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://doi.org/10.18287/1613-0073-2019-2416-368-375","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032332722","display_name":"Vladimir Michailovich Ramzaev","orcid":"https://orcid.org/0009-0005-7512-5021","observed_orcids":["https://orcid.org/0009-0005-7512-5021"]},"institutions":[{"id":"https://openalex.org/I4210121860","display_name":"International Market Institute","ror":"https://ror.org/02xhk8637","country_code":"RU","type":"education","lineage":["https://openalex.org/I4210121860"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Vladimir Ramzaev","raw_affiliation_strings":["Samara University of Public Administration \u00abInternational Market Institute\u00bb, G S Aksakova Street, 21, Samara, Russia, 443030"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Samara University of Public Administration \u00abInternational Market Institute\u00bb, G S Aksakova Street, 21, Samara, Russia, 443030","institution_ids":["https://openalex.org/I4210121860"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045016654","display_name":"\u0418. \u041d. \u0425\u0430\u0439\u043c\u043e\u0432\u0438\u0447","orcid":"https://orcid.org/0000-0002-8798-3745","observed_orcids":["https://orcid.org/0000-0002-8798-3745"]},"institutions":[{"id":"https://openalex.org/I3124489027","display_name":"Samara National Research University","ror":"https://ror.org/05ggagb37","country_code":"RU","type":"education","lineage":["https://openalex.org/I3124489027"]},{"id":"https://openalex.org/I4210121860","display_name":"International Market Institute","ror":"https://ror.org/02xhk8637","country_code":"RU","type":"education","lineage":["https://openalex.org/I4210121860"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Irina Khaimovich","raw_affiliation_strings":["Samara National Research University, Moskovskoe Shosse 34A, Samara, Russia, 443086","Samara University of Public Administration \u00abInternational Market Institute\u00bb, G S Aksakova Street, 21, Samara, Russia, 443030"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Samara National Research University, Moskovskoe Shosse 34A, Samara, Russia, 443086","institution_ids":["https://openalex.org/I3124489027"]},{"raw_affiliation_string":"Samara University of Public Administration \u00abInternational Market Institute\u00bb, G S Aksakova Street, 21, Samara, Russia, 443030","institution_ids":["https://openalex.org/I4210121860"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065152435","display_name":"Ilya Martynov","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I3124489027","display_name":"Samara National Research University","ror":"https://ror.org/05ggagb37","country_code":"RU","type":"education","lineage":["https://openalex.org/I3124489027"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Ilya Martynov","raw_affiliation_strings":["Samara National Research University, Moskovskoe Shosse 34A, Samara, Russia, 443086"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Samara National Research University, Moskovskoe Shosse 34A, Samara, Russia, 443086","institution_ids":["https://openalex.org/I3124489027"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"368","last_page":"375"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.8393999934196472,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.8393999934196472,"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.15309999883174896,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.003100000089034438,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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-algorithms","display_name":"shortest path algorithms","score":0.9210000038146973},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"graph algorithms","score":0.8700000047683716},{"id":"https://openalex.org/keywords/dijkstra-s-algorithm","display_name":"Dijkstra's algorithm","score":0.8259999752044678},{"id":"https://openalex.org/keywords/floyd-warshall-algorithm","display_name":"Floyd-Warshall algorithm","score":0.9449999928474426},{"id":"https://openalex.org/keywords/wave-algorithm","display_name":"wave algorithm","score":0.6729999780654907},{"id":"https://openalex.org/keywords/graph-databases","display_name":"graph databases","score":0.5199999809265137},{"id":"https://openalex.org/keywords/algorithm-comparison","display_name":"algorithm comparison","score":0.6309999823570251},{"id":"https://openalex.org/keywords/execution-time","display_name":"execution time","score":0.46299999952316284}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7728888988494873},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7125528454780579},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.6672516465187073},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.6500705480575562},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.6019439101219177},{"id":"https://openalex.org/C510870499","wikidata":"https://www.wikidata.org/wiki/Q47607","display_name":"SQL","level":2,"score":0.5169110298156738},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.49339476227760315},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.4582291543483734},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.45795950293540955},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42336559295654297},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3388655185699463},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3312828540802002},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.2007099986076355},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.11666214466094971}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.18287/1613-0073-2019-2416-368-375","doi":"https://doi.org/10.18287/1613-0073-2019-2416-368-375","is_oa":true,"landing_page_url":"https://doi.org/10.18287/1613-0073-2019-2416-368-375","pdf_url":"https://doi.org/10.18287/1613-0073-2019-2416-368-375","source":{"id":"https://openalex.org/S4363607880","display_name":"International Conference on Information Technology and Nanotechnology (ITNT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the V International conference Information Technology and Nanotechnology 2019","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.18287/1613-0073-2019-2416-368-375","doi":"https://doi.org/10.18287/1613-0073-2019-2416-368-375","is_oa":true,"landing_page_url":"https://doi.org/10.18287/1613-0073-2019-2416-368-375","pdf_url":"https://doi.org/10.18287/1613-0073-2019-2416-368-375","source":{"id":"https://openalex.org/S4363607880","display_name":"International Conference on Information Technology and Nanotechnology (ITNT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the V International conference Information Technology and Nanotechnology 2019","raw_type":"proceedings-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2993536552.pdf","grobid_xml":"https://content.openalex.org/works/W2993536552.grobid-xml"},"referenced_works_count":11,"referenced_works":["https://openalex.org/W1966600255","https://openalex.org/W2011214980","https://openalex.org/W2014722142","https://openalex.org/W2079395598","https://openalex.org/W2176166251","https://openalex.org/W2322518605","https://openalex.org/W2342713236","https://openalex.org/W2522838574","https://openalex.org/W2545240043","https://openalex.org/W2767622126","https://openalex.org/W2887817292"],"related_works":["https://openalex.org/W4411076126","https://openalex.org/W7100794735","https://openalex.org/W2128644323","https://openalex.org/W2992231720","https://openalex.org/W4252457296","https://openalex.org/W2991426845","https://openalex.org/W3207523283","https://openalex.org/W7208729925","https://openalex.org/W2898643502","https://openalex.org/W2621499375"],"abstract_inverted_index":{"The":[0,27],"article":[1],"implements":[2],"the":[3,10,16,20,24,34,40,47,56,63,70,76,82],"functions":[4],"in":[5,81],"Postgre":[6,83],"SQL":[7,84],"DBMS,":[8],"finding":[9],"shortest":[11,77],"paths":[12],"on":[13,44,46],"graphs,":[14],"using":[15],"wave":[17],"algorithm":[18],"method,":[19],"Dijkstra\u2019s":[21],"method":[22],"and":[23],"Floyd":[25],"method.":[26],"authors":[28],"determined":[29],"models":[30],"of":[31,33,37,39,49,55,62,73,75],"dependencies":[32],"running":[35],"time":[36],"implementations":[38,74],"shortest-path":[41],"search":[42,79],"algorithms":[43,80],"graphs":[45],"number":[48],"graph":[50],"vertices":[51],"experimentally.":[52],"A":[53],"comparison":[54],"data":[57],"obtained":[58],"as":[59],"a":[60],"result":[61],"study":[64],"was":[65],"carried":[66],"out":[67],"to":[68],"find":[69],"best":[71],"applications":[72],"path":[78],"DBMS.":[85]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2026-10-30T12:39:25.321706","created_date":"2019-12-13T00:00:00"}