1749 search results - page 47 / 350 » Conditional colorings of graphs |
127
click to vote
ICAT
2007
IEEE
15 years 10 months ago
2007
IEEE
This study concerns the development of 3D interfaces that aid the navigation of large data structures through the usage of the HSV color space, and the ensuing “spatial framesâ€...
133
Voted
DM
2008
15 years 4 months ago
2008
Ore presented a degree condition involving every pair of nonadjacent vertices for a graph to be hamiltonian. Fan (J. Combin. Theory Ser. B 37 (1984) 221
140
click to vote
CP
2007
Springer
15 years 10 months ago
2007
Springer
The increasing levels of system integration in Multi-Processor System-on-Chips (MPSoCs) emphasize the need for new design flows for efficient mapping of multi-task applications o...
156
click to vote
ISLPED
2003
ACM
15 years 9 months ago
2003
ACM
We propose a novel power-aware task scheduling algorithm for DVS-enabled real-time multiprocessor systems. Unlike the existing algorithms, the proposed DVS algorithm can handle co...
149
Voted
JCO
2007
15 years 4 months ago
2007
The problem of radio channel assignments with multiple levels of interference can be modelled using graph theory. The theory of integer vertex-labellings of graphs with distance c...