355 search results - page 57 / 71 » On Central Spanning Trees of a Graph |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We consider the problem of generating all ideals of a poset. It is a long standing open problem, whether or not the ideals of any poset can be generated in constant amortized time...
ISCC
2005
IEEE
14 years 1 months ago
2005
IEEE
— As broadcasting is widely used for miscellaneous maintenance operations in wireless ad hoc networks, where energy is a scarce resource, an efficient broadcasting protocol is o...
FSTTCS
2007
Springer
14 years 1 months ago
2007
Springer
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pa...
ESA
2009
Springer
14 years 2 months ago
2009
Springer
In this paper we show that iterative rounding is a powerful and flexible tool in the design of approximation algorithms for multiobjective optimization problems. We illustrate tha...
ICRA
2005
IEEE
14 years 1 months ago
2005
IEEE
Abstract - This paper presents an improvement over a previous contour closure algorithm. Assuming that edge points are given as input, the proposed approach consists of two steps. ...