1632 search results - page 53 / 327 » On special numberings of hypergraphs |
154
click to vote
EJC
2000
15 years 6 months ago
2000
We study the zeros of two families of polynomials related to rook theory and matchings in graphs. One of these families is based on the cover polynomial of a digraph introduced by ...
180
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...
138
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Network intruders try to hide their identity by relaying their traf c through a number of intermediate hosts, called stepping stones. Network ow watermarks have been used to detec...
156
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
It is well known that LDPC decoding is computationally demanding and one of the hardest signal operations to parallelize. Beyond data dependencies that restrict the decoding of a ...
149
click to vote
DM
2008
15 years 6 months ago
2008
For graphs G and H, let G H denote their Cartesian sum. This paper investigates the chromatic number and the circular chromatic number for GH. It is proved that (G H) max{ c(G)...