Sciweavers

125 search results - page 11 / 25
» ams 2000
Sort
View
SODA
2000
ACM
121views Algorithms» more  SODA 2000»
14 years 11 months ago
Coloring powers of planar graphs
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 ...
Geir Agnarsson, Magnús M. Halldórsso...
COMBINATORICS
2000
82views more  COMBINATORICS 2000»
14 years 9 months ago
The Strongly Regular (40, 12, 2, 4) Graphs
In a previous paper it was established that there are at least 27 non-isomorphic strongly regular (40, 12, 2, 4) graphs. Using a different and more efficient method we have re-inv...
Edward Spence
CORR
2000
Springer
81views Education» more  CORR 2000»
14 years 9 months ago
Safe cooperative robot dynamics on graphs
This paper initiates the use of vector fields to design, optimize, and implement reactive schedules for safe cooperative robot patterns on planar graphs. We consider Automated Gui...
Robert Ghrist, Daniel E. Koditschek
CORR
2000
Springer
134views Education» more  CORR 2000»
14 years 9 months ago
Learning Complexity Dimensions for a Continuous-Time Control System
This paper takes a computational learning theory approach to a problem of linear systems identification. It is assumed that inputs are generated randomly from a known class consist...
Pirkko Kuusela, Daniel Ocone, Eduardo D. Sontag
SIAMAM
2000
89views more  SIAMAM 2000»
14 years 9 months ago
An Efficient Numerical Algorithm for Cracks Partly in Frictionless Contact
An algorithm for a loaded crack partly in frictionless contact is presented. The problem is nonlinear in the sense that the equations of linear elasticity are supplemented by certa...
Gunnar Peters, Johan Helsing