Výsledky vyhledávání - "Anna Nepomniaschaya"

Constructions Used in Associative Parallel Algorithms for Directed Graphs

Autor: Anna Nepomniaschaya

Publikováno v: Lecture Notes in Computer Science ISBN: 9783319219080
PaCT

The paper selects constructions that are used to implement a group of algorithms for directed graphs on a model of associative parallel systems with vertical processing the STAR---machine. Moreover, a new implementation on the STAR---machine of Dijks

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::354b489757da8dc8e6e1e5bdd5ec0663
https://doi.org/10.1007/978-3-319-21909-7_19

Zobrazit plný text záznamu

A Simple Implementation of Dijkstra's Shortest Path Algorithm on Associative Parallel Processors

Autor: Anna Nepomniaschaya, Maria A. Dvoskina

Publikováno v: Fundamenta Informaticae. 43:227-243

In this paper we propose a natural straight forward implementation of Dijkstra's shortest path algorithm on a model of associative parallel processors of the SIMD type with bit-serial (or vertical) processing (the STAR-machine). In addition, we show

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::b718a4c486c6c2033be1cf7f52a509cb
https://doi.org/10.3233/fi-2000-43123412

Zobrazit plný text záznamu

CONSTRUCTIONS USED IN ASSOCIATIVE PARALLEL ALGORITHMS FOR UNDIRECTED GRAPHS. PART 1

Autor: Anna Nepomniaschaya

Publikováno v: Bulletin of the Novosibirsk Computing Center. Series:Computer Science.

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::e00a34b8e752d128ce556ae76ded6d74
https://doi.org/10.31144/bncc.cs.2542-1972.2013.n35.p69-83

Zobrazit plný text záznamu

Efficient Associative Algorithm for Finding the Second Simple Shortest Paths in a Digraph

Autor: Anna Nepomniaschaya

Publikováno v: Lecture Notes in Computer Science ISBN: 9783642231773
PaCT

We present an associative algorithm for finding the second simple shortest paths from the source vertex to other vertices of a directed weighted graph. Our model of computation (the STAR-machine) simulates the run of associative (content addressable)

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::76a8966fe353a1f314d4286e58ea2c6a
https://doi.org/10.1007/978-3-642-23178-0_16

Zobrazit plný text záznamu

Associative Version of the Ramalingam Decremental Algorithm for Dynamic Updating the Single-Sink Shortest-Paths Subgraph

Autor: Anna Nepomniaschaya

Publikováno v: Lecture Notes in Computer Science ISBN: 9783642032745
PaCT

We propose an efficient implementation of the Ramalingam algorithm for dynamic updating the single-sink shortest-paths subgraph of a directed weighted graph after deletion of an edge using a model of associative (content addressable) parallel systems

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::668874cbc611ed98fbf96798c5948935
https://doi.org/10.1007/978-3-642-03275-2_26

Zobrazit plný text záznamu

Associative Version of Italiano’s Decremental Algorithm for the Transitive Closure Problem

Autor: Anna Nepomniaschaya

Publikováno v: Lecture Notes in Computer Science ISBN: 9783540739395
PaCT

We propose a natural implementation of Italiano's algorithm for updating the transitive closure of directed graphs after deletion of an edge on a model of associative (content addressable) parallel systems with vertical processing (the STAR-machine).

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::c879ddd1424769ce3f96132117bcc0a0
https://doi.org/10.1007/978-3-540-73940-1_44

Zobrazit plný text záznamu

Associative Parallel Algorithm for Dynamic Reconstruction of a Minimum Spanning Tree After Deletion of a Vertex

Autor: Anna Nepomniaschaya

Publikováno v: Lecture Notes in Computer Science ISBN: 9783540281269
PaCT

In this paper, we propose an associative parallel algorithm for updating a minimum spanning tree when a vertex and all its incident edges are deleted from the underlying graph. This algorithm is represented as the corresponding procedure implemented

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::e6da30dd2232cf7ad34cafa2b7ad4020
https://doi.org/10.1007/11535294_14

Zobrazit plný text záznamu

Associative graph processor and its properties

Autor: Anna Nepomniaschaya, Kokosiński, Z.

Publikováno v: Scopus-Elsevier

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::864dbb2a4ee280b802b2d473d26bb181
https://doi.org/10.1109/pcee.2004.1335626

Zobrazit plný text záznamu

Associative Parallel Algorithms for Dynamic Edge Update of Minimum Spanning Trees

Autor: Anna Nepomniaschaya

Publikováno v: Lecture Notes in Computer Science ISBN: 9783540406730
PaCT

In this paper we propose two associative parallel algorithms for the edge update of a minimum spanning tree when an edge is deleted or inserted in the underlying graph. These algorithms are represented as the corresponding procedures implemented on a

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::408014f2b64ae71fd7d451127c4934b3
https://doi.org/10.1007/978-3-540-45145-7_12

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání