2432 search results - page 218 / 487 » Degrees and choice numbers |
197
click to vote
BMCBI
2005
15 years 6 months ago
2005
Background: Recent analysis of the yeast gene network shows that most genes have few inputs, indicating that enumerative gene reconstruction methods are both useful and computatio...
159
click to vote
JCO
2007
15 years 6 months ago
2007
A graph G is said to be m-sufficient if m is not exceeding the order of G, each vertex of G is of even degree, and the number of edges in G is a multiple of m. A complete multipar...
101
click to vote
COMPUTER
2002
15 years 6 months ago
2002
Despite enthusiastic predictions in the trade press, an X.509-style PKI has so far failed to eventuate to any significant degree. This paper looks at some of the reasons behind th...
179
click to vote
DM
2002
15 years 6 months ago
2002
We consider a variation of the chip-firing game in a induced subgraph S of a graph G. Starting from a given chip configuration, if a vertex v has at least as many chips as its deg...
186
click to vote
CAD
1999
Springer
15 years 6 months ago
1999
Springer
This paper presents algorithms for computing offsets of NURBS curves and surfaces. The basic approach consists of four steps: (1) recognition of special curves and surfaces; (2) s...