Computing orthogonal drawings with the minimum number of bends (Q5096950): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/3-540-63307-3_72 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1799248239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A better heuristic for orthogonal graph drawings / 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: An experimental comparison of four graph drawing algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line maintenance of triconnected components with SPQR-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3883524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computational Complexity of Upward and Rectilinear Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dividing a Graph into Triconnected Components / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4702188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs: Theory and algorithms / 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

Latest revision as of 22:48, 29 July 2024

scientific article; zbMATH DE number 7573300
Language Label Description Also known as
English
Computing orthogonal drawings with the minimum number of bends
scientific article; zbMATH DE number 7573300

    Statements

    Computing orthogonal drawings with the minimum number of bends (English)
    0 references
    0 references
    0 references
    0 references
    19 August 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references