226 search results - page 13 / 46 » Lower bounds on the obstacle number of graphs |
SIAMDM
2008
13 years 7 months ago
2008
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
DM
1999
13 years 7 months ago
1999
We characterize bipartite Steinhaus graphs in three ways by partitioning them into four classes and we describe the color sets for each of these classes. An interesting recursion ...
RANDOM
2001
Springer
14 years 8 days ago
2001
Springer
d Abstract) Noga Alon1, , Michael Capalbo2, , Yoshiharu Kohayakawa3, , Vojtˇech R¨odl4,† , Andrzej Ruci´nski5,‡ , and Endre Szemer´edi6,§ 1 Department of Mathematics, Raym...
AAAI
2008
13 years 10 months ago
2008
This paper investigates the impact of symbolic search for solving domain-independent action planning problems with binary decision diagrams (BDDs). Polynomial upper and exponential...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We examine online grid covering with hexagonal and triangular grids. For arbitrary environments without obstacles we provide a strategy that produces tours of length S C + 1 4 E ...