3471 search results - page 87 / 695 » Obstacle Numbers of Graphs |
108
click to vote
CORR
2010
Springer
15 years 1 days 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 ...
162
click to vote
COMGEO
2012
ACM
13 years 10 months ago
2012
ACM
We study a class of multi-commodity flow problems in geometric domains: For a given planar domain P populated with obstacles (holes) of K ≥ 2 types, compute a set of thick path...
118
Voted
COMBINATORICS
2006
15 years 2 months ago
2006
A set of vertices S is a determining set for a graph G if every automorphism of G is uniquely determined by its action on S. The determining number of a graph is the size of a sma...
120
Voted
SODA
2000
ACM
15 years 4 months ago
2000
ACM
We give nontrivial bounds for the inductiveness or degeneracy of power graphs Gk of a planar graph G. This implies bounds for the chromatic number as well, since the inductiveness ...
115
Voted
ACMACE
2008
ACM
15 years 4 months ago
2008
ACM
This paper proposes a new method to generate smooth camera movement that is collision-free in a three-dimensional virtual environment. It generates a set of cells based on cell de...