1857 search results - page 20 / 372 » Minimum Degree Orderings |
TIT
2008
13 years 10 months ago
2008
We study the functional codes C2(X) defined on projective varieties X, in the case where X P3 is a 1-degenerate quadric or a non-degenerate quadric (hyperbolic or elliptic). We fi...
FFA
2007
13 years 10 months ago
2007
Miyaji, Nakabayashi and Takano (MNT) gave families of group orders of ordinary elliptic curves with embedding degree suitable for pairing applications. In this paper we generalise ...
DM
2002
13 years 10 months ago
2002
A generalized p-cycle is a digraph whose set of vertices can be partitioned into p parts that are cyclically ordered in such a way that the vertices in one part are adjacent only ...
IPL
2011
13 years 5 months ago
2011
Arpe and Manthey [Algorithmica’09] recently studied the minimum ANDcircuit problem, which is a circuit minimization problem, and showed some results including approximation algo...
JGT
2010
13 years 5 months ago
2010
Thomassen [9] conjectured that for all natural numbers k > 0 and m, every graph of minimum degree k + 1 contains a cycle of length congruent to 2m modulo k. We prove that this ...