2069 search results - page 45 / 414 » Linear time algorithms for Clobber |
153
click to vote
ICML
2007
IEEE
16 years 4 months ago
2007
IEEE
A geometric and non parametric procedure for testing if two nite set of points are linearly separable is proposed. The Linear Separability Test is equivalent to a test that deter...
116
click to vote
CORR
2004
Springer
15 years 3 months ago
2004
Springer
A Meyniel graph is a graph in which every odd cycle of length at least five has two chords. We present a linear-time algorithm that colors optimally the vertices of a Meyniel grap...
159
click to vote
RTSS
2006
IEEE
15 years 9 months ago
2006
IEEE
In many applications we can deploy large number of sensors spanning wide geographical areas, to monitor environmental phenomena. The analysis of the data collected by such sensor ...
144
click to vote
LICS
2010
IEEE
15 years 1 months ago
2010
IEEE
We prove that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. That is, for every class C of graphs such that some graph H is...
IPL
2006
15 years 3 months ago
2006
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is the k...