3471 search results - page 604 / 695 » Obstacle Numbers of Graphs |
151
Voted
GD
2005
Springer
15 years 10 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...
142
click to vote
IPSN
2005
Springer
15 years 10 months ago
2005
Springer
A wireless sensor network consists of a large number of small, resource-constrained devices and usually operates in hostile environments that are prone to link and node failures. ...
135
click to vote
SAT
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clau...
163
click to vote
FCT
2005
Springer
15 years 10 months ago
2005
Springer
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...
155
click to vote
PEWASUN
2004
ACM
15 years 10 months ago
2004
ACM
Interferences in an ad-hoc network can be defined as a set of constraints that specify which groups of nodes cannot transmit simultaneously, and they have significant implications...