An experimental comparison of four graph drawing algorithms. (Q2482890): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4003324 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing plane graphs nicely / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for drawing a planar graph on a grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-dimensional graph drawing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for drawing graphs: An annotated bibliography / rank
 
Normal rank
Property / cites work
 
Property / cites work: DAG—a program that draws directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum planar subgraphs and nice embeddings: Practical layout tools / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for drawing general undirected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analytical Solution of Vector Diffraction for Focusing Optical Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037427 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient orthogonal drawings of high degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3757930 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rectilinear planar layouts and bipolar orientations of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Embedding a Graph in the Grid with the Minimum Number of Bends / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to visibility representations of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Draw a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universality considerations in VLSI circuits / rank
 
Normal rank

Latest revision as of 22:16, 27 June 2024

scientific article
Language Label Description Also known as
English
An experimental comparison of four graph drawing algorithms.
scientific article

    Statements

    An experimental comparison of four graph drawing algorithms. (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    25 April 2008
    0 references
    graph drawing
    0 references
    orthogonal drawings
    0 references
    algorithms implementation
    0 references
    experimental comparison of algorithms
    0 references

    Identifiers