1986 search results - page 152 / 398 » Path Separability of Graphs |
176
click to vote
JAL
2006
15 years 6 months ago
2006
: We consider a variety of vehicle routing problems. The input to a problem consists of a graph G = (N, E) and edge lengths l(e) e E. Customers located at the vertices have to be ...
162
click to vote
IJRR
2002
15 years 6 months ago
2002
The goal of coverage path planning is to determine a path that passes a detector over all points in an environment. This work prescribes a provably complete coverage path planner ...
167
click to vote
MFCS
1998
Springer
15 years 10 months ago
1998
Springer
It is known that a language is context-free iff it is the set of borders of the trees of recognizable set, where the border of a (labelled) tree is the word consisting of its leaf ...
171
click to vote
VIZSEC
2005
Springer
15 years 12 months ago
2005
Springer
While efficient graph-based representations have been developed for modeling combinations of low-level network attacks, relatively little attention has been paid to effective tech...
159
click to vote
GD
2005
Springer
15 years 12 months ago
2005
Springer
Clustered graph is a very useful model for drawing large and complex networks. This paper presents a new method for drawing clustered graphs in three dimensions. The method uses a ...