The Straight-Line RAC Drawing Problem Is NP-Hard (Q3075508): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59702333, #quickstatements; #temporary_batch_1706826130171
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 / OpenAlex ID
 
Property / OpenAlex ID: W2110336351 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1009.5227 / 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: Q3154375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Rectilinearity and Angular Resolution / 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: Drawing Graphs in the Plane with High Resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing Number is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing graphs. Methods and models / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Quality Ratio of RAC Drawings and Planar Drawings of Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Angular Resolution of Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Empirical evaluation of aesthetics-based graph layout / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:15, 3 July 2024

scientific article
Language Label Description Also known as
English
The Straight-Line RAC Drawing Problem Is NP-Hard
scientific article

    Statements

    The Straight-Line RAC Drawing Problem Is NP-Hard (English)
    0 references
    0 references
    0 references
    0 references
    15 February 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references