New bounds on the barycenter heuristic for bipartite graph drawing. (Q1853018): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q864029
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: Matthias F. M. Stallmann / rank
 
Normal rank

Revision as of 07:14, 21 February 2024

scientific article
Language Label Description Also known as
English
New bounds on the barycenter heuristic for bipartite graph drawing.
scientific article

    Statements

    New bounds on the barycenter heuristic for bipartite graph drawing. (English)
    0 references
    0 references
    21 January 2003
    0 references
    Barycenter heuristic
    0 references
    Performance ratio
    0 references
    Graph drawing
    0 references

    Identifiers