3008 search results - page 421 / 602 » Independence in connected graphs |
209
click to vote
DM
2002
15 years 6 months ago
2002
A simple characterization of the 3, 4, or 5-colorable Eulerian triangulations of the projective plane is given. Key words: Projective plane, triangulation, coloring, Eulerian grap...
196
click to vote
EMSOFT
2011
Springer
14 years 6 months ago
2011
Springer
Most of the hard-real-time scheduling theory for multiprocessor systems assumes independent periodic or sporadic tasks. Such a simple task model is not directly applicable to mode...
176
click to vote
ICIP
2008
IEEE
16 years 8 months ago
2008
IEEE
This article presents a new algorithm for spatial deinterlacing that could easily be integrated in a more complete deinterlacing system. The spatial interpolation process often fa...
158
click to vote
ICIP
2009
IEEE
16 years 8 months ago
2009
IEEE
We propose a new fibre tracking algorithm for cardiac DTMRI that parts with the locally "greedy" paradigm intrinsic to conventional tracking algorithms. We formulate the...
190
click to vote
AAIM
2009
Springer
16 years 1 months ago
2009
Springer
We study restricted improvement cycles (ri-cycles) in finite positional n-person games with perfect information modeled by directed graphs (digraphs) that may contain cycles. We o...