Sciweavers

25 search results - page 3 / 5
» Colouring Random 4-Regular Graphs
Sort
View
62
Voted
DMTCS
2002
100views Mathematics» more  DMTCS 2002»
14 years 11 months ago
Upper bounds on the non-3-colourability threshold of random graphs
Nikolaos Fountoulakis, Colin McDiarmid
GLOBECOM
2007
IEEE
15 years 6 months ago
Colouring Link-Directional Interference Graphs in Wireless Ad Hoc Networks
—In this paper, we clarify inter-link interference in wireless ad-hoc networks by using link-directional interference graphs (l-graph). Most of the interference graphs in the lit...
Ping Chung Ng, David J. Edwards, Soung Chang Liew
CPC
2002
95views more  CPC 2002»
14 years 11 months ago
Permutation Pseudographs And Contiguity
The space of permutation pseudographs is a probabilistic model of 2-regular pseudographs on n vertices, where a pseudograph is produced by choosing a permutation of {1, 2, . . . ...
Catherine S. Greenhill, Svante Janson, Jeong Han K...
COCOA
2009
Springer
15 years 6 months ago
Roulette Wheel Graph Colouring for Solving Examination Timetabling Problems
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...
Nasser R. Sabar, Masri Ayob, Graham Kendall, Rong ...