Drawing graphs with right angle crossings (Q719252): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2011.05.025 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4205588752 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q62042493 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Size of Graphs That Admit Polyline Drawings with Few Bends and Crossing Angles / 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: On the Perspectives Opened by Right Angle Crossing Drawings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing the Total Resolution of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Straight-Line RAC Drawing Problem Is NP-Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs that Admit Right Angle Crossing Drawings / 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: 2-layer right angle crossing drawings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Area, Curve Complexity, and Crossing Resolution of Non-planar Graph Drawings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing Graphs with Right Angle Crossings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of complete bipartite RAC graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology-Driven Force-Directed Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Constrained Notions of Planarity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Right Angle Crossing Graphs and 1-Planarity / 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
Property / cites work
 
Property / cites work: The Quality Ratio of RAC Drawings and Planar Drawings of Planar Graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:47, 4 July 2024

scientific article
Language Label Description Also known as
English
Drawing graphs with right angle crossings
scientific article

    Statements

    Drawing graphs with right angle crossings (English)
    0 references
    0 references
    0 references
    0 references
    10 October 2011
    0 references
    graph visualization
    0 references
    0 references
    0 references
    0 references

    Identifiers