A heuristic approach towards drawings of graphs with high crossing resolution (Q1725757): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2889444332 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs That Admit Polyline Drawings with Few Crossing Angles / 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: Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area / 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: Maximizing the Total Resolution of Graphs / 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: \(\mathsf{NIC}\)-planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On RAC drawings of 1-planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing and drawing IC-planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to draw a planar graph on a grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3154375 / 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: Drawing graphs with right angle crossings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology-Driven Force-Directed Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notes on large angle crossing graphs / 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: Edge crossings in drawings of bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing Graphs in the Plane with High Resolution / 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: An efficient graph planarization two‐phase heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Full Outer-2-planarity in Linear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing planar graphs using the canonical ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing graphs. Methods and models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3102944 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:13, 18 July 2024

scientific article
Language Label Description Also known as
English
A heuristic approach towards drawings of graphs with high crossing resolution
scientific article

    Statements

    A heuristic approach towards drawings of graphs with high crossing resolution (English)
    0 references
    0 references
    15 February 2019
    0 references

    Identifiers