1857 search results - page 131 / 372 » Minimum Degree Orderings |
169
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Convolutional network-error correcting codes (CNECCs) are known to provide error correcting capability in acyclic instantaneous networks within the network coding paradigm under sm...
148
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
In the present article, we consider algebraic geometry codes on some rational surfaces. The estimate of the minimum distance is translated into a point counting problem on plane cu...
146
click to vote
JCT
2008
15 years 6 months ago
2008
A 4-graph is odd if its vertex set can be partitioned into two sets so that every edge intersects both parts in an odd number of points. Let b(n) = max n 3 + (n - ) 3 = 1 2 + o...
161
click to vote
JGT
2008
15 years 6 months ago
2008
A homomorphism from an oriented graph G to an oriented graph H is a mapping from the set of vertices of G to the set of vertices of H such that ----(u)(v) is an arc in H whenever...
168
click to vote
DAM
2007
15 years 6 months ago
2007
We study the following problem: Given a tree G and a finite set of trees H, find a subset O of the edges of G such that G − O does not contain a subtree isomorphic to a tree f...