HV-planarity: algorithms and complexity (Q1628786): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Computing orthogonal drawings with the minimum number of bends / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal graph drawing with flexibility constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal graph drawing with inflexible edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turn-regularity and optimal area drawings of orthogonal representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4580103 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing database schemas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3154375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The shape of orthogonal cycles in three dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding problems for paths with direction constrained edges. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spirality and Optimal Orthogonal Drawings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on 3D orthogonal drawings with direction constrained edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upward Spirality and Upward Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing HV-Restricted Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed edge-length graph drawing is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bend-optimal orthogonal graph drawing in the general position model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / 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: Graph Drawing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding rectilinear graphs in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Planarity Testing / 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: Q3997942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Finding Non-Planar Rectilinear Drawings of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bend Minimization in Planar Orthogonal Drawings Using Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3154374 / 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: A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal Drawings of Plane Graphs Without Bends / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Drawing and Applications for Software and Knowledge Engineers / 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: Q3102944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Contribution to the Theory of Chromatic Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rectilinear Graphs and Their Embeddings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends / rank
 
Normal rank

Latest revision as of 15:01, 17 July 2024

scientific article
Language Label Description Also known as
English
HV-planarity: algorithms and complexity
scientific article

    Statements

    HV-planarity: algorithms and complexity (English)
    0 references
    0 references
    0 references
    0 references
    10 December 2018
    0 references
    graph drawing
    0 references
    orthogonal drawings
    0 references
    HV-planarity
    0 references
    testing algorithms
    0 references
    complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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