113 search results - page 8 / 23 » When can a graph form an orthogonal polyhedron |
ICDCS
2002
IEEE
14 years 9 days ago
2002
IEEE
Abstract—We propose a new geometric spanner for wireless ad hoc networks, which can be constructed efficiently in a distributed manner. It integrates the connected dominating se...
CIS
2010
Springer
13 years 2 months ago
2010
Springer
A group of mobile robots can localize cooperatively, using relative position and absolute orientation measurements, fused through an extended Kalman filter (ekf). The topology of ...
KDD
2005
ACM
14 years 7 months ago
2005
ACM
We present an algorithm for mining tree-shaped patterns in a large graph. Novel about our class of patterns is that they can contain constants, and can contain existential nodes w...
FMCO
2003
Springer
14 years 17 days ago
2003
Springer
In this paper we discuss the question which properties of a formally verified component are preserved when the component is changed due to an adaption to a new use. More specific...
COMBINATORICA
2007
13 years 7 months ago
2007
A complete partition of a graph G is a partition of its vertex set in which any two distinct classes are connected by an edge. Let cp(G) denote the maximum number of classes in a ...