Drawing Graphs with Right Angle Crossings (Q3183456): 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: Q59702316 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum number of edges in quasi-planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-planar graphs have a linear number of edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representations of Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3154375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangles in Euclidean arrangements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph drawing software / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing graphs. Methods and models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3154374 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the crossing lemma by finding more crossings in sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete and Computational Geometry / 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: Empirical evaluation of aesthetics-based graph layout / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum number of triangles in arrangements of pseudolines / rank
 
Normal rank

Latest revision as of 01:25, 2 July 2024

scientific article
Language Label Description Also known as
English
Drawing Graphs with Right Angle Crossings
scientific article

    Statements

    Identifiers

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