9 search results - page 1 / 2 » A note on the acyclic 3-choosability of some planar graphs |
DAM
2010
13 years 4 months ago
2010
STACS
2009
Springer
13 years 11 months ago
2009
Springer
The notions of hypertree width and generalized hypertree width were introduced by Gottlob, Leone, and Scarcello in order to extend the concept of hypergraph acyclicity. These noti...
FOCS
2009
IEEE
13 years 11 months ago
2009
IEEE
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
ICML
1996
IEEE
14 years 5 months ago
1996
IEEE
Some of the most successful recent applications of reinforcement learning have used neural networks and the TD algorithm to learn evaluation functions. In this paper, we examine t...
COMBINATORICS
2006
13 years 4 months ago
2006
We present a variation of James Propp's generalized domino shuffling, which provides an efficient way to obtain perfect matchings of weighted Aztec diamonds. Our modification...