Graph layering by promotion of nodes (Q2489908): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
(One intermediate revision by one other user not shown) | |||
Property / DOI | |||
Property / DOI: 10.1016/j.dam.2005.05.023 / rank | |||
Property / cites work | |||
Property / cites work: Width-restricted layering of acyclic digraphs with consideration of dummy nodes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal scheduling for two-processor systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An experimental comparison of four graph drawing algorithms. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3985344 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4422266 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3043701 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4040221 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: NP-complete scheduling problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Crossing Theory and Hierarchy Mapping / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.DAM.2005.05.023 / rank | |||
Normal rank |
Latest revision as of 23:45, 18 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Graph layering by promotion of nodes |
scientific article |
Statements
Graph layering by promotion of nodes (English)
0 references
28 April 2006
0 references
Graph drawing
0 references
Layered directed acyclic graph
0 references
Layering algorithm
0 references