Drawing Graphs with GLEE (Q5452241): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q56226610 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing Graphs with GLEE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short and smooth polygonal paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4422269 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3043702 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal scheduling for two-processor systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Drawing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph drawing. 10th international symposium, GD 2002, Irvine, CA, USA, August 26--28, 2002. Revised papers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4422266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph layering by promotion of nodes / rank
 
Normal rank
Property / cites work
 
Property / cites work: In search for efficient heuristics for minimum-width graph layering with consideration of dummy nodes / rank
 
Normal rank

Latest revision as of 18:58, 27 June 2024

scientific article; zbMATH DE number 5252843
Language Label Description Also known as
English
Drawing Graphs with GLEE
scientific article; zbMATH DE number 5252843

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references