157 search results - page 13 / 32 » Frugal Colouring of Graphs |
EVOW
2006
Springer
14 years 20 days ago
2006
Springer
Abstract. We introduce a novel representation for the graph colouring problem, called the Integer Merge Model, which aims to reduce the time complexity of an algorithm. Moreover, o...
WONS
2005
IEEE
14 years 2 months ago
2005
IEEE
At present, no standard frequency allocation mechanism exists for Wireless LAN access points. In this article, we introduce a number of techniques based on graph colouring algorit...
CONSTRAINTS
2007
13 years 9 months ago
2007
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
COCOA
2009
Springer
14 years 3 months ago
2009
Springer
This work presents a simple graph based heuristic that employs a roulette wheel selection mechanism for solving examination timetabling problems. We arrange exams in non-increasing...
ENDM
2007
13 years 9 months ago
2007
In 1977, Wegner conjectured that the chromatic number of the square of every planar graph G with maximum degree ∆ ≥ 8 is at most 3