3267 search results - page 285 / 654 » Generalized quasirandom graphs |
198
click to vote
JCT
2006
15 years 6 months ago
2006
Eroh and Oellermann defined BRR(G1, G2) as the smallest N such that any edge coloring of the complete bipartite graph KN,N contains either a monochromatic G1 or a multicolored G2....
170
click to vote
TIT
2008
15 years 6 months ago
2008
For a linear code , the stopping redundancy of is defined as the minimum number of check nodes in a Tanner graph T for such that the size of the smallest stopping set in T is equal...
164
Voted
TIT
2008
15 years 6 months ago
2008
This article describes new theoretical results concerning the general behavior of a Feedback with Carry Shift Register (FCSR) automaton. They help to better understand how the init...
176
click to vote
JACM
2000
15 years 6 months ago
2000
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
173
click to vote
GC
2002
Springer
15 years 6 months ago
2002
Springer
An orientation of a digraph D is a spanning subdigraph of D obtained from D by deleting exactly one arc between x and y for every pair x = y of vertices such that both xy and yx a...