505 search results - page 52 / 101 » On A Graph Formalism for Ordered Edges |
CORR
2004
Springer
14 years 9 months ago
2004
Springer
Cryptographic applications using an elliptic curve over a finite field filter curves for suitability using their order as the primary criterion: e.g. checking that their order has...
120
click to vote
GD
1998
Springer
15 years 1 months ago
1998
Springer
We demonstrate the H3Viewer graph drawing library, which can be run from a standalone program or in conjunction with other programs such as SGI's Site Manager application. Our...
SIROCCO
2007
14 years 11 months ago
2007
We consider the problem of periodic exploration of all nodes in undirected graphs by using a nite state automaton called later a robot. The robot, using a constant number of state...
DM
2011
14 years 4 months ago
2011
If X is a geodesic metric space and x1, x2, x3 ∈ X, a geodesic triangle T = {x1, x2, x3} is the union of the three geodesics [x1x2], [x2x3] and [x3x1] in X. The space X is δ-hy...
CCR
2004
14 years 9 months ago
2004
As the Internet grows in size, it becomes crucial to understand how the speeds of links in the network must improve in order to sustain the pressure of new end-nodes being added e...