157 search results - page 6 / 32 » Frugal Colouring of Graphs |
FOCS
2003
IEEE
14 years 1 months ago
2003
IEEE
We show that random graphs in the preferential connectivity model have constant conductance, and hence have worst-case routing congestion that scales logarithmically with the numb...
EVOW
2005
Springer
14 years 1 months ago
2005
Springer
In this paper, we combine a powerful representation for graph colouring problems with different heuristic strategies for colour assignment. Our novel strategies employ heuristics ...
CPC
2008
13 years 7 months ago
2008
In 1998 Luczak, R
DM
2008
13 years 7 months ago
2008
This paper discusses the game colouring number of partial k-trees and planar graphs. Let colg(PT k) and colg(P) denote the maximum game colouring number of partial k trees and the...
IPL
2008
13 years 7 months ago
2008
Colouring a graph with its chromatic number of colours is known to be NP-hard. Identifying an algorithm in which descisions are made locally with no information about the graph�...