Lower Bounds and Parallel Algorithms for Planar Orthogonal Grid Drawings

doi 10.1109/spdp.1991.218215
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

IEEE Comput. Soc. Press

Related search

Hexagonal Grid Drawings: Algorithms and Lower Bounds

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds

2020English

Slanted Orthogonal Drawings: Model, Algorithms and Evaluations

Journal of Graph Algorithms and Applications
GeometryComputer Science ApplicationsComputer ScienceMathematicsComputational TheoryTheoretical Computer ScienceTopology
2014English

Efficient Algorithms and Lower Bounds for Robust Linear Regression

2019English

Straight-Line Monotone Grid Drawings of Series–parallel Graphs

Discrete Mathematics, Algorithms and Applications
CombinatoricsDiscrete Mathematics
2015English

Planar Lombardi Drawings for Subcubic Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

The Quality Ratio of RAC Drawings and Planar Drawings of Planar Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Routing of Monotonic Parallel and Orthogonal Netlists for Single-Layer Ball Grid Array Packages

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Electronic EngineeringComputer GraphicsSignal ProcessingApplied MathematicsElectricalComputer-Aided Design
2006English

A Better Heuristic for Orthogonal Graph Drawings

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1994English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy