Výsledky vyhledávání - dynamic shortest path tree(dept) algorithm*

Algorithms for effective querying of compound graph-based pathway databases Autor Dogrusoz, Ugur, Cetintas, Ahmet, Demir, Emek, Babur, Ozgun

“… and dynamic properties. An extension of this graph representation, namely hierarchically structured or compound graphs, in which a member of a biological network may recursively contain a sub-network of a somehow logically…”
Získat plný text

Parallel algorithms for the k shortest paths and related problems Autor Ruppert, Eric

“…A parallel algorithm is developed to find the k shortest paths between pairs of vertices in an edge-weighed directed graph…”
Získat plný text