1736 search results - page 126 / 348 » On antimagic directed graphs |
169
click to vote
MICS
2008
15 years 6 months ago
2008
Multi-level overlay graphs represent a speed-up technique for shortest paths computation which is based on a hierarchical decomposition of a weighted directed graph G. They have b...
179
click to vote
TOG
2002
15 years 6 months ago
2002
In this paper we present a novel method for creating realistic, controllable motion. Given a corpus of motion capture data, we automatically construct a directed graph called a mo...
188
click to vote
SODA
2000
ACM
15 years 7 months ago
2000
ACM
We describe a new external memory data structure, the buffered repository tree, and use it to provide the first non-trivial external memory algorithm for directed breadth-first se...
188
click to vote
IWOMP
2007
Springer
16 years 20 days ago
2007
Springer
OpenMP is widely used for shared memory parallel programming and is especially useful for the parallelisation of loops. When it comes to task parallelism, however, OpenMP is less p...
154
click to vote
ISIPTA
2003
IEEE
15 years 11 months ago
2003
IEEE
Independence models induced by some uncertainty measures (e.g. conditional probability, possibility) do not obey the usual graphoid properties, since they do not satisfy the symme...