ABSTRACT
Meet Edmond and Lucy with their adventures in the forest!
Recommendations
On the hardness of full Steiner tree problems
Given a weighted graph G = ( V , E ) and a subset R of V, a Steiner tree in G is a tree which spans all vertices in R. The vertices in V R are called Steiner vertices. A full Steiner tree is a Steiner tree in which each vertex of R is a leaf. The full ...
On computing the number of (BC-)subtrees, eccentric subtree number, and global and local means of trees
Highlights- Algorithms for computing the number of subtrees of trees in linear-time;
- the ...
AbstractIn this paper, we present algorithms for computing the number of subtrees of trees in linear-time, the number of BC-subtrees of trees in linear-time, the global mean of trees in linear-time, the local mean of a given vertex of trees in ...
Trajectory Planning for the Walking Biped "Lucy"
A real-time joint trajectory generator for planar walking bipeds is proposed. In the near future this trajectory planner will be implemented on the robot "Lucy", which is actuated by pleated pneumatic artificial ...
Comments