Sciweavers

212 search results - page 19 / 43
» On Lengths of Rainbow Cycles
Sort
View
COMBINATORICS
2002
111views more  COMBINATORICS 2002»
13 years 9 months ago
A Density Result for Random Sparse Oriented Graphs and its Relation to a Conjecture of Woodall
We shall prove that for all 3 and > 0 there exists a sparse oriented graph of arbitrarily large order with oriented girth and such that any 1/2 + proportion of its arcs induc...
Jair Donadelli, Yoshiharu Kohayakawa
IPL
2002
71views more  IPL 2002»
13 years 9 months ago
Pancyclicity of recursive circulant graphs
In this paper, we study the existence of cycles of all lengths in the recursive circulant graphs, and we show a necessary and sufficient condition for the graph being pancyclic an...
Toru Araki, Yukio Shibata
IBMRD
2006
76views more  IBMRD 2006»
13 years 9 months ago
Modeling wire delay, area, power, and performance in a simulation infrastructure
We present Justice, a set of extensions to the Liberty simulation infrastructure that model area, wire length, and power consumption in processor architectures. Given an architectu...
Nicholas P. Carter, Azmat Hussain
IEE
2002
92views more  IEE 2002»
13 years 9 months ago
Comparison of Web size measures for predicting Web design and authoring effort
: Software practitioners recognise the importance of realistic estimates of effort for the successful management of software projects, the Web being no exception. Estimates are nec...
Emilia Mendes, Nile Mosley, Steve Counsell
DCC
2001
IEEE
14 years 9 months ago
How to Choose Secret Parameters for RSA-Type Cryptosystems over Elliptic Curves
Recently, and contrary to the common belief, Rivest and Silverman argued that the use of strong primes is unnecessary in the RSA cryptosystem. This paper analyzes how valid this as...
Marc Joye, Jean-Jacques Quisquater, Tsuyoshi Takag...