1986 search results - page 69 / 398 » Path Separability of Graphs |
ICRA
2006
IEEE
14 years 2 months ago
2006
IEEE
— This paper describes an off-line, iterative algorithm for simultaneous localization and mapping within large indoor environments. The proposed approach is based on the idea of ...
ISAAC
2010
Springer
13 years 6 months ago
2010
Springer
It has been conjectured by Golumbic and Monma in 1984 that the intersection of tolerance and cocomparability graphs coincides with bounded tolerance graphs. Since cocomparability g...
DM
2008
13 years 8 months ago
2008
A sequence of the form s1s2 . . . sms1s2 . . . sm is called a repetition. A vertex-coloring of a graph is called nonrepetitive if none of its paths is repetitively colored. We ans...
COMBINATORICS
1999
13 years 8 months ago
1999
Let k denote the maximum degree of the kth iterated line graph Lk(G). For any connected graph G that is not a path, the inequality k+1 2k - 2 holds. Niepel, Knor, and Solt
ITC
2003
IEEE
14 years 2 months ago
2003
IEEE
– It is well known that the output signals measured by an automatic test equipment (ATE) system are not only due to the device-under-test (DUT), but also due to the test path. Fo...