1632 search results - page 32 / 327 » On special numberings of hypergraphs |
161
click to vote
JGT
2006
15 years 6 months ago
2006
Jeager et al introduced a concept of group connectivity as an generalization of nowhere zero flows and its dual concept group coloring, and conjectured that every 5-edge connected...
154
click to vote
COMBINATORICS
2004
15 years 6 months ago
2004
In this paper we bring together the areas of combinatorics and propositional satisfiability. Many combinatorial theorems establish, often constructively, the existence of positive...
163
click to vote
FOCS
1999
IEEE
15 years 10 months ago
1999
IEEE
We consider the DIRECTED STEINER NETWORK problem, also called the POINT-TO-POINT CONNECTION problem, where given a directed graph G and p pairs {(s1,t1),...,(sp,tp)} of nodes in t...
161
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We present algorithms for the discrete cosine transform (DCT) and discrete sine transform (DST), of types II and III, that achieve a lower count of real multiplications and additi...
151
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We present algorithms for the type-IV discrete cosine transform (DCT-IV) and discrete sine transform (DST-IV), as well as for the modified discrete cosine transform (MDCT) and it...