Sciweavers

Share
3 search results - page 1 / 1
» latin 1995
Sort
View
LATIN
1995
Springer
10 years 6 months ago
Linear-Time Algorithms for Parametric Minimum Spanning Tree Problems on Planar Graphs
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...
David Fernández-Baca, Giora Slutzki
LATIN
1995
Springer
10 years 6 months ago
Reversible Cellular Automaton Able to Simulate Any Other Reversible One Using Partitioning Automata
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...
Jérôme Olivier Durand-Lose
LATIN
2010
Springer
10 years 9 months ago
Minimum-Perimeter Intersecting Polygons
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...
Adrian Dumitrescu, Minghui Jiang
books