Complexity analysis of balloon drawing for rooted trees (Q620957): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q62041801, #quickstatements; #temporary_batch_1710979808849
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2010.10.015 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Q3154375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4853751 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for a bottleneck traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing graphs. Methods and models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Workforce Planning in Mixed Model Assembly Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Balloon Drawings of Rooted Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity analysis of balloon drawing for rooted trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Angular Resolution of Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Gilmore-Gomory's open question for the bottleneck TSP. / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/tcs/LinYPF11 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2010.10.015 / rank
 
Normal rank

Latest revision as of 22:54, 9 December 2024

scientific article
Language Label Description Also known as
English
Complexity analysis of balloon drawing for rooted trees
scientific article

    Statements

    Complexity analysis of balloon drawing for rooted trees (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    2 February 2011
    0 references
    tree drawing
    0 references
    graph drawing
    0 references
    graph algorithms
    0 references

    Identifiers