PROXIMITY DRAWINGS OF HIGH-DEGREE TREES (Q3459369): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Witness (Delaunay) graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing proximity trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A near-linear area bound for drawing binary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing area and aspect ratio in straight-line orthogonal tree drawings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar $ST$-Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on optimal area algorithms for upward drawings of binary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strength of weak proximity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Thickness of Complete Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawings of planar graphs with few slopes and segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph treewidth and geometric thickness parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graph thickness, geometric thickness, and separator theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The realization problem for Euclidean minimum spanning trees is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Absolutely 3-chromatic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial area bounds for MST embeddings of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal graphs that fold onto \(K_ n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Straight-line Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing trees symmetrically in three dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On representations of some thickness-two graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logarithmic width, linear area upward drawing of AVL trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Order-preserving, upward drawing of binary trees using fewer bends / rank
 
Normal rank
Property / cites work
 
Property / cites work: Voronoi drawings of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitions in geometric minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximity drawings in polynomial area and volume / rank
 
Normal rank
Property / cites work
 
Property / cites work: Area-efficient algorithms for straight-line tree drawings / rank
 
Normal rank
Property / cites work
 
Property / cites work: PATHWIDTH AND LAYERED DRAWINGS OF TREES / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relative neighbourhood graph of a finite planar set / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on minimum-area upward drawing of complete and Fibonacci trees / rank
 
Normal rank

Revision as of 06:32, 11 July 2024

scientific article
Language Label Description Also known as
English
PROXIMITY DRAWINGS OF HIGH-DEGREE TREES
scientific article

    Statements

    PROXIMITY DRAWINGS OF HIGH-DEGREE TREES (English)
    0 references
    0 references
    0 references
    0 references
    22 December 2015
    0 references
    graph drawing
    0 references
    tree
    0 references
    proximity graph
    0 references
    minimum spanning tree
    0 references
    relative neighbourhood graph
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references