3471 search results - page 4 / 695 » Obstacle Numbers of Graphs |
109
click to vote
COMPGEOM
2005
ACM
15 years 1 months ago
2005
ACM
We introduce a new type of diagram called the VV(c)-diagram (the visibility–Voronoi diagram for clearance c), which is a hybrid between the visibility graph and the Voronoi diag...
90
Voted
ERSHOV
1999
Springer
15 years 3 months ago
1999
Springer
Abstract. The paper describes a problem of multi-agent path planning in environment with obstacles. Novel approach to multi-agent optimal path planning, using graph representation ...
110
Voted
ALGORITHMICA
2011
14 years 6 months ago
2011
A nonplanar graph G is near-planar if it contains an edge e such that G−e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from diffe...
97
Voted
DCG
2008
14 years 11 months ago
2008
The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a graph, where each intersection is counted separately. If instead we count the nu...
86
Voted
TPDS
1998
14 years 11 months ago
1998
—One of the main obstacles in obtaining high performance from message-passing multicomputer systems is the inevitable communication overhead which is incurred when tasks executin...