721 search results - page 18 / 145 » Almost universal graphs |
91
Voted
CRYPTO
2007
Springer
15 years 6 months ago
2007
Springer
This work describes a mode of operation, TET, that turns a regular block cipher into a length-preserving enciphering scheme for messages of (almost) arbitrary length. When using a...
105
click to vote
SODA
2008
ACM
15 years 2 months ago
2008
ACM
In this paper, we study online algorithms when the input is not chosen adversarially, but consists of draws from some given probability distribution. While this model has been stu...
CPC
2004
15 years 17 days ago
2004
Mader asked whether every C4-free graph G contains a subdivision of a complete graph whose order is at least linear in the average degree of G. We show that there is a subdivision...
125
click to vote
ICALP
2011
Springer
14 years 4 months ago
2011
Springer
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...
103
Voted
ARSCOM
2004
15 years 17 days ago
2004
We first prove that for any fixed k a cubic graph with few short cycles contains a Kk-minor. This is a direct generalisation of a result on girth by Thomassen. We then use this the...