Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

35

SPDP
1991
IEEE

favoriteEmaildiscussreport

93views Distributed And Parallel Com...» more SPDP 1991»

Lower bounds and parallel algorithms for planar orthogonal grid drawings

14 years 2 months ago

Lower bounds and parallel algorithms for planar orthogonal grid drawings

Download www.cs.brown.edu

Roberto Tamassia, Ioannis G. Tollis, Jeffrey Scott

Real-time Traffic

Distributed And Parallel Computing | SPDP 1991 |

claim paper

Related Content

» A Parallel Algorithm for Planar Orthogonal Grid Drawings

» Orthogonal Drawings of SeriesParallel Graphs with Minimum Bends

» Area Requirements for Drawing Hierarchically Planar Graphs

» Drawing Planar Graphs with Circular Arcs

Post Info
More Details (n/a)

Added	27 Aug 2010
Updated	27 Aug 2010
Type	Conference
Year	1991
Where	SPDP
Authors	Roberto Tamassia, Ioannis G. Tollis, Jeffrey Scott Vitter

Comments (0)