On the complexity of orthogonal compaction (Q5943322): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
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: Turn-regularity and optimal area drawings of orthogonal representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3154375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding rectilinear graphs in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263720 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / 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: Rectilinear Graphs and Their Embeddings / rank
 
Normal rank

Latest revision as of 19:51, 3 June 2024

scientific article; zbMATH DE number 1642992
Language Label Description Also known as
English
On the complexity of orthogonal compaction
scientific article; zbMATH DE number 1642992

    Statements

    On the complexity of orthogonal compaction (English)
    0 references
    9 September 2001
    0 references
    0 references
    SAT reduction
    0 references
    orthogonal grid drawings
    0 references