3 search results - page 1 / 1 » latin 1995 |
197
Voted
LATIN
1995
Springer
15 years 10 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...
169
Voted
LATIN
1995
Springer
15 years 10 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...
151
Voted
LATIN
2010
Springer
16 years 1 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...