Sciweavers

157 search results - page 16 / 32
» Frugal Colouring of Graphs
Sort
View
JCT
2006
47views more  JCT 2006»
13 years 9 months ago
A map colour theorem for the union of graphs
Michael Stiebitz, Riste Skrekovski
DMTCS
2002
100views Mathematics» more  DMTCS 2002»
13 years 8 months ago
Upper bounds on the non-3-colourability threshold of random graphs
Nikolaos Fountoulakis, Colin McDiarmid
ILP
2007
Springer
14 years 3 months ago
Structural Statistical Software Testing with Active Learning in a Graph
Structural Statistical Software Testing (SSST) exploits the control flow graph of the program being tested to construct test cases. Specifically, SSST exploits the feasible paths...
Nicolas Baskiotis, Michèle Sebag