A note on parallel algorithms for optimal h-v drawings of binary trees (Q1384199): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple parallel tree contraction algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parallel Evaluation of General Arithmetic Expressions / 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: TWO TREE DRAWING CONVENTIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4525739 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal orientations of cells in slicing floorplan designs / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0925-7721(96)00018-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2073388777 / rank
 
Normal rank

Latest revision as of 09:23, 30 July 2024

scientific article
Language Label Description Also known as
English
A note on parallel algorithms for optimal h-v drawings of binary trees
scientific article

    Statements

    Identifiers