1857 search results - page 28 / 372 » Minimum Degree Orderings |
163
click to vote
APPROX
2008
Springer
15 years 7 months ago
2008
Springer
In order to perform an average-case analysis for specific input distributions one needs to derive and understand properties of a 'typical' input instance. In the case of...
150
click to vote
LATIN
2010
Springer
16 years 3 days ago
2010
Springer
For a static array A of n totally ordered objects, a range minimum query asks for the position of the minimum between two specified array indices. We show how to preprocess A into...
113
click to vote
JGT
2008
15 years 5 months ago
2008
Mader conjectured that for all there is an integer + ( ) such that every digraph of minimum outdegree at least + ( ) contains a subdivision of a transitive tournament of order . In...
125
click to vote
ANTS
2006
Springer
15 years 9 months ago
2006
Springer
We present a general framework for constructing families of elliptic curves of prime order with prescribed embedding degree. We demonstrate this method by constructing curves with ...
188
click to vote
APAL
2011
15 years 10 days ago
2011
We study ideals in the computably enumerable Turing degrees, and their upper bounds. Every proper Σ0 4 ideal in the c.e. Turing degrees has an incomplete upper bound. It follows t...