On the approximability of two tree drawing conventions (Q294876): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Created claim: Wikidata QID (P12): Q127526103, #quickstatements; #temporary_batch_1722357939539
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate solution of NP optimization problems / 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: Algorithms for drawing graphs: An annotated bibliography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3154375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: TWO TREE DRAWING CONVENTIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: PLANAR UPWARD TREE DRAWINGS WITH OPTIMAL AREA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on parallel algorithms for optimal h-v drawings of binary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal orientations of cells in slicing floorplan designs / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2011413408 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127526103 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:47, 30 July 2024

scientific article
Language Label Description Also known as
English
On the approximability of two tree drawing conventions
scientific article

    Statements

    On the approximability of two tree drawing conventions (English)
    0 references
    0 references
    16 June 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    approximation algorithms
    0 references
    tree drawing
    0 references
    computational complexity
    0 references
    computational geometry
    0 references
    0 references
    0 references