99 search results - page 7 / 20 » Labeling planar graphs with a condition at distance two |
WADS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. In this paper, we propose a new compact and low delay routing labeling scheme for Unit Disk Graphs (UDGs) which often model wireless ad hoc networks. We show that one can...
JGT
2010
13 years 6 months ago
2010
: A well-known result of Tutte states that a 3-connected graph G is planar if and only if every edge of G is contained in exactly two induced non-separating circuits. Bixby and Cun...
FOCS
2004
IEEE
13 years 11 months ago
2004
IEEE
The Metric Labeling problem is an elegant and powerful mathematical model capturing a wide range of classification problems. The input to the problem consists of a set of labels a...
ACL
2006
13 years 9 months ago
2006
Shortage of manually labeled data is an obstacle to supervised relation extraction methods. In this paper we investigate a graph based semi-supervised learning algorithm, a label ...
ICRA
2005
IEEE
14 years 1 months ago
2005
IEEE
— This paper presents a method for a planar rigid body consisting of multiple convex bodies to explore an unknown planar workspace, i.e., an unknown configuration space diffeomo...