3415 search results - page 357 / 683 » Lower bounds on kernelization |
156
click to vote
ARSCOM
2004
15 years 6 months ago
2004
The domatic number of a graph G is the maximum number of dominating sets into which the vertex set of G can be partitioned. We show that the domatic number of a random r-regular g...
151
click to vote
COMBINATORICS
2000
15 years 6 months ago
2000
The set R of relevant cycles of a graph G is the union of its minimum cycle bases. We introduce a partition of R such that each cycle in a class W can be expressed as a sum of oth...
145
click to vote
IJBC
2002
15 years 6 months ago
2002
We give a method for finding symbolic dynamics for a planar diffeomorphism with a homoclinic tangle. The method only requires a finite piece of tangle, which can be computed with ...
180
click to vote
JAIR
2002
15 years 6 months ago
2002
We develop, analyze, and evaluate a novel, supervised, specific-to-general learner for a simple temporal logic and use the resulting algorithm to learn visual event definitions fr...
169
click to vote
LOGCOM
2002
15 years 6 months ago
2002
This paper defines and examines model checking games for the branching time temporal logic CTL . The games employ a technique called focus which enriches sets by picking out one d...