Graph layering by promotion of nodes (Q2489908): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2005.05.023 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2003825820 / rank
 
Normal 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

Latest revision as of 12:29, 24 June 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
    0 references
    0 references
    28 April 2006
    0 references
    Graph drawing
    0 references
    Layered directed acyclic graph
    0 references
    Layering algorithm
    0 references

    Identifiers