306 search results - page 59 / 62 » Computing the Girth of a Planar Graph |
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
A class of relational structures is said to have the extension preservation property if every first-order sentence that is preserved under extensions on the class is equivalent t...
ACSC
2002
IEEE
14 years 16 days ago
2002
IEEE
This paper examines QoS guarantees for bandwidth in mobile wireless networks, with a focus on reducing dropped connections on handoff. We can achieve this by reserving bandwidth f...
CDC
2008
IEEE
14 years 2 months ago
2008
IEEE
We develop a novel localization theory for planar networks of nodes that measure each other’s relative position, i.e., we assume that nodes do not have the ability to perform me...
ICRA
2008
IEEE
14 years 2 months ago
2008
IEEE
— This paper focuses on the assignment of discrete points to two robots, in the presence of geometric and kinematic constraints between the robots. The individual points have dif...
GD
2005
Springer
14 years 1 months ago
2005
Springer
In this paper we investigate the problem of drawing metro maps which is defined as follows. Given a planar graph G of maximum degree 8 with its embedding and vertex locations (e.g...