Rooted Uniform Monotone Minimum Spanning Trees

DOI10.1007/978-3-319-57586-5_34zbMath1486.68136arXiv1607.03338OpenAlexW2963359392MaRDI QIDQ5283385

Antonios Symvonis, Konstantinos Mastakas

Publication date: 21 July 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1607.03338

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

Rooted Uniform Monotone Minimum Spanning Trees ⋮ Drawing a rooted tree as a rooted \(y\)-monotone minimum spanning tree

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nearly optimal monotone drawing of trees
• Monotone drawings of graphs with few directions
• Algorithms for plane representations of acyclic digraphs
• Decomposable searching problems
• Monotone drawings of graphs with fixed embedding
• On the Computational Complexity of Upward and Rectilinear Planarity Testing
• Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design
• Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition
• On self-approaching and increasing-chord drawings of 3-connected planar graphs
• Applications of a Planar Separator Theorem
• Optimal Search in Planar Subdivisions
• Multidimensional Searching Problems
• Self-approaching curves
• Curves with increasing chords
• Self-approaching Graphs
• Rooted Uniform Monotone Minimum Spanning Trees
• Monotone Drawings of Graphs
• Increasing-Chord Graphs On Point Sets

This page was built for publication: Rooted Uniform Monotone Minimum Spanning Trees