The complexity of drawing trees nicely (Q1168727): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Edward M. Reingold / rank
Normal rank
 
Property / author
 
Property / author: Edward M. Reingold / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Positive Integral Solutions of Linear Diophantine Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A numbering system for binary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4144192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-Complete Approximation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pretty-printing of trees / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:45, 13 June 2024

scientific article
Language Label Description Also known as
English
The complexity of drawing trees nicely
scientific article

    Statements

    The complexity of drawing trees nicely (English)
    0 references
    0 references
    0 references
    1983
    0 references
    drawings of binary trees
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references