Results 221 to 230 of about 827,001 (270)
MR-guided reconstruction of PET data in spinal cord PET/MRI. [PDF]
Lennie E +5 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
2019
In this contribution, we describe the main graph algorithms that are applied in several fields, from transport network to computational biology. First, we will review two-well known traversal algorithms (depth-first search and breadth-first search).
Dondi, R, Mauri, G, Zoppis, I
openaire +2 more sources
In this contribution, we describe the main graph algorithms that are applied in several fields, from transport network to computational biology. First, we will review two-well known traversal algorithms (depth-first search and breadth-first search).
Dondi, R, Mauri, G, Zoppis, I
openaire +2 more sources
2011
Shimon Even's Graph Algorithms, published in 1979, was a seminal introductory book on algorithms read by everyone engaged in the field. This thoroughly revised second edition, with a foreword by Richard M. Karp and notes by Andrew V. Goldberg, continues the exceptional presentation from the first edition and explains algorithms in a formal but simple ...
Ananth Kalyanaraman +17 more
openaire +2 more sources
Shimon Even's Graph Algorithms, published in 1979, was a seminal introductory book on algorithms read by everyone engaged in the field. This thoroughly revised second edition, with a foreword by Richard M. Karp and notes by Andrew V. Goldberg, continues the exceptional presentation from the first edition and explains algorithms in a formal but simple ...
Ananth Kalyanaraman +17 more
openaire +2 more sources
Graph Optimal Monomorphism Algorithms
IEEE Transactions on Systems, Man, and Cybernetics, 1980The characterization of graph morphisms in terms of the subgraphs of the Cartesian graph product is extended and used to develop algorithms for an optimal graph monomorphism problem. The objective functional considered is defined as the sum of the weights associated with vertex and arc mappings.
Ghahraman, David E. +2 more
openaire +1 more source
IEEE Transactions on Systems, Man, and Cybernetics, 1980
Ghahraman, David E. +2 more
openaire +2 more sources
Ghahraman, David E. +2 more
openaire +2 more sources
1993
Abstract Introduction. This section develops an algorithm for parsing precedence gram mars and the evaluation of an arithmetic expression in O(lg n) time. Although parts of this algorithm are somewhat similar to the doubling algorithms of the previous section, we put these algorithms in a separate section because of their complexity ...
openaire +1 more source
Abstract Introduction. This section develops an algorithm for parsing precedence gram mars and the evaluation of an arithmetic expression in O(lg n) time. Although parts of this algorithm are somewhat similar to the doubling algorithms of the previous section, we put these algorithms in a separate section because of their complexity ...
openaire +1 more source

