Sciweavers

151 search results - page 5 / 31
» Derandomized Squaring of Graphs
Sort
View
IPL
2008
98views more  IPL 2008»
13 years 6 months ago
On the number of Go positions on lattice graphs
We use transfer matrix methods to determine bounds for the numbers of legal Go positions for various numbers of players on some planar lattice graphs, including square lattice gra...
Graham Farr, Johannes Schmidt
ICALP
2009
Springer
14 years 7 months ago
Fast FAST
We present a randomized subexponential time, polynomial space parameterized algorithm for the k-Weighted Feedback Arc Set in Tournaments (k-FAST) problem. We also show that our alg...
Noga Alon, Daniel Lokshtanov, Saket Saurabh
ENDM
2007
68views more  ENDM 2007»
13 years 6 months ago
List Colouring Squares of Planar Graphs
In 1977, Wegner conjectured that the chromatic number of the square of every planar graph G with maximum degree ∆ ≥ 8 is at most 3
Frédéric Havet, Jan van den Heuvel, ...
ARSCOM
2008
82views more  ARSCOM 2008»
13 years 6 months ago
Note on Coloring the Square of an Outerplanar Graph
Wei-Fan Wang, Ko-Wei Lih