3 search results - page 1 / 1 » latin 1995 |
LATIN
1995
Springer
13 years 8 months ago
1995
Springer
A linear-time algorithm for the minimum-ratio spanning tree problem on planar graphs is presented. The algorithm is based on a new planar minimum spanning tree algorithm. The appr...
LATIN
1995
Springer
13 years 8 months ago
1995
Springer
Partitioning automata (PA) are de ned. They are equivalent to cellular automata (CA). Reversible sub-classes are also equivalent. A simple, reversible and universal partitioning au...
LATIN
2010
Springer
13 years 11 months ago
2010
Springer
Given a set S of segments in the plane, a polygon P is an intersecting polygon of S if every segment in S intersects the interior or the boundary of P. The problem MPIP of computi...