1736 search results - page 150 / 348 » On antimagic directed graphs |
162
click to vote
TALG
2008
15 years 6 months ago
2008
The Tower of Hanoi problem is generalized by placing pegs on the vertices of a given directed graph G with two distinguished vertices, S and D, and allowing moves only along arcs o...
202
click to vote
PAMI
2007
15 years 6 months ago
2007
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....
184
click to vote
IPPS
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract--NABBIT is a work-stealing library for execution of task graphs with arbitrary dependencies which is implemented as a library for the multithreaded programming language Ci...
151
click to vote
WETICE
1996
IEEE
15 years 10 months ago
1996
IEEE
The Multi-Head, Multi-Tail, Multi-Client (MMM) Browsing Project is a continuing effort to bring stronger graph semantics to the World Wide Web thereby increasing the Web's us...
203
click to vote
CGF
2008
15 years 6 months ago
2008
Most graph visualization techniques focus on the structure of graphs and do not offer support for dealing with node attributes and edge labels. To enable users to detect relations...