{"id":"https://openalex.org/W2123930386","doi":"https://doi.org/10.1007/3-540-62064-8_18","title":"An associative version of the Prim-Dijkstra algorithm and its application to some graph problems","display_name":"An associative version of the Prim-Dijkstra algorithm and its application to some graph problems","publication_year":1996,"publication_date":"1996-01-01","ids":{"openalex":"https://openalex.org/W2123930386","doi":"https://doi.org/10.1007/3-540-62064-8_18","mag":"2123930386"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-62064-8_18","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-62064-8_18","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/A5065826034","display_name":"Anna Nepomniaschaya","orcid":"https://orcid.org/0000-0001-8386-5402"},"institutions":[{"id":"https://openalex.org/I4210127387","display_name":"Siberian Branch of the Russian Academy of Sciences","ror":"https://ror.org/02frkq021","country_code":"RU","type":"funder","lineage":["https://openalex.org/I1313323035","https://openalex.org/I4210127387"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"A. S. Nepomniaschaya","raw_affiliation_strings":["Siberian Division of Russian Academy of Sciences"],"affiliations":[{"raw_affiliation_string":"Siberian Division of Russian Academy of Sciences","institution_ids":["https://openalex.org/I4210127387"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5065826034"],"corresponding_institution_ids":["https://openalex.org/I4210127387"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.5952,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.6808409,"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":"203","last_page":"213"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9983999729156494,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9983999729156494,"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"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9976000189781189,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9973000288009644,"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/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.8873157501220703},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.8686407208442688},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.78841233253479},{"id":"https://openalex.org/keywords/a*-search-algorithm","display_name":"A* search algorithm","score":0.684133768081665},{"id":"https://openalex.org/keywords/associative-property","display_name":"Associative property","score":0.612549364566803},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5598829984664917},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.45710572600364685},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45459699630737305},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.380573034286499},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.2713165581226349},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14012455940246582}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.8873157501220703},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.8686407208442688},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.78841233253479},{"id":"https://openalex.org/C103578098","wikidata":"https://www.wikidata.org/wiki/Q277680","display_name":"A* search algorithm","level":2,"score":0.684133768081665},{"id":"https://openalex.org/C159423971","wikidata":"https://www.wikidata.org/wiki/Q177251","display_name":"Associative property","level":2,"score":0.612549364566803},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5598829984664917},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.45710572600364685},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45459699630737305},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.380573034286499},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.2713165581226349},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14012455940246582},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-62064-8_18","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-62064-8_18","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":15,"referenced_works":["https://openalex.org/W1529771304","https://openalex.org/W1553143963","https://openalex.org/W1568888158","https://openalex.org/W1605552448","https://openalex.org/W1980284639","https://openalex.org/W1992122785","https://openalex.org/W2017927472","https://openalex.org/W2095359628","https://openalex.org/W2125502827","https://openalex.org/W2135601680","https://openalex.org/W2169528473","https://openalex.org/W2506366055","https://openalex.org/W2526736138","https://openalex.org/W2561675875","https://openalex.org/W4243815659"],"related_works":["https://openalex.org/W2382258861","https://openalex.org/W3157110573","https://openalex.org/W3084957793","https://openalex.org/W2182059131","https://openalex.org/W3205035283","https://openalex.org/W2385737134","https://openalex.org/W4281943708","https://openalex.org/W3103134159","https://openalex.org/W2364536249","https://openalex.org/W2362266639"],"abstract_inverted_index":null,"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}