Orthogonal and Quasi-Upward Drawings With Vertices of Prescribed Size

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-46648-7_31
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Planar Upward Tree Drawings With Optimal Area

International Journal of Computational Geometry and Applications
GeometryApplied MathematicsComputational TheoryComputational MathematicsMathematicsTheoretical Computer ScienceTopology
1996English

Moving Vertices to Make Drawings Plane

English

Slanted Orthogonal Drawings: Model, Algorithms and Evaluations

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

Orthogonal Drawings of Plane Graphs Without Bends

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

On Short Cycles Through Prescribed Vertices of a Polyhedral Graph

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2005English

A Better Heuristic for Orthogonal Graph Drawings

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1994English

Finding Elliptic Curves With a Subgroup of Prescribed Size

International Journal of Number Theory
Number TheoryAlgebra
2016English

Lower Bounds and Parallel Algorithms for Planar Orthogonal Grid Drawings

English

Quadratic-Time Linear-Space Algorithms for Generating Orthogonal Polygons With a Given Number of Vertices

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy