446 search results - page 56 / 90 » A fast algorithm for computing steiner edge connectivity |
GD
2009
Springer
14 years 5 days ago
2009
Springer
We show that each quadrangulation on n vertices has a closed rectangle of influence drawing on the (n − 2) × (n − 2) grid. Further, we present a simple algorithm to obtain a...
RT
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. Methods for exact computation of irradiance and form factors associated with polygonal objects have ultimately relied on a formula for a differential area to polygon form...
COCO
2004
Springer
14 years 28 days ago
2004
Springer
An NP search problem is the problems of finding a witness to the given NP predicate, and TFNP is the class of total NP search problems. TFNP contains a number of subclasses conta...
WG
1995
Springer
13 years 11 months ago
1995
Springer
Abstract. In this paper, we investigate which processor networks allow klabel Interval Routing Schemes, under the assumption that costs of edges may vary. We show that for each xed...
IROS
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract— We present an efficient algorithm for complete motion planning that combines approximate cell decomposition (ACD) with probabilistic roadmaps (PRM). Our approach uses ...