354 search results - page 38 / 71 » The Chromatic Number Of Graph Powers |
CORR
2010
Springer
14 years 8 months ago
2010
Springer
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...
COCOON
2003
Springer
15 years 5 months ago
2003
Springer
The relationship between graph coloring and the immersion order is considered. Vertex connectivity, edge connectivity and related issues are explored. These lead to the conjecture...
111
click to vote
ICPP
2002
IEEE
15 years 4 months ago
2002
IEEE
Power aware computing has become popular recently and many techniques have been proposed to manage the energy consumption for traditional real-time applications. We have previousl...
ISLPED
2003
ACM
15 years 5 months ago
2003
ACM
This paper proposes two very fast graph theoretic heuristics for the low power binding problem given fixed number of resources and multiple architectures for the resources. First...
ISM
2006
IEEE
15 years 5 months ago
2006
IEEE
Given a large social or computer network, how can we visualize it, find patterns, outliers, communities? Although several graph visualization tools exist, they cannot handle larg...