A Better Heuristic for Orthogonal Graph Drawings

Lecture Notes in Computer Science - Germany
doi 10.1007/bfb0049394
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

A Graph-Based Hyper-Heuristic for Educational Timetabling Problems

European Journal of Operational Research
Information SystemsSimulationManagement ScienceManagementComputer ScienceModelingOperations Research
2007English

A New Placement Heuristic for the Orthogonal Stock-Cutting Problem

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
2004English

Interactive Orthogonal Graph Drawing

IEEE Transactions on Computers
HardwareArchitectureMathematicsComputational TheoryTheoretical Computer ScienceSoftware
1998English

A Linear Algorithm for Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1997English

Orthogonal Drawings of Plane Graphs Without Bends

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

Slanted Orthogonal Drawings: Model, Algorithms and Evaluations

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

Three-Dimensional 1-Bend Graph Drawings

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

Lower Bounds and Parallel Algorithms for Planar Orthogonal Grid Drawings

English

An Algorithm for Three-Dimensional Orthogonal Graph Drawing

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1998English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy