Computing cartograms with optimal complexity (Q5891266): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Proportional Contact Representations of 4-Connected Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Algorithms for Hole-Free Rectilinear Proportional Contact Graph Representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proportional Contact Representations of Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing cartograms with optimal complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal Cartograms with Few Corners Per Face / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rectangular layouts and contact graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for drawing a planar graph on a grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rectilinear duals for vertex-weighted plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: OPTIMAL BSPs AND RECTILINEAR CARTOGRAMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Triangle Contact Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On topological aspects of orientations / 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: Optimal polygonal representation of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Area-Universal and Constrained Rectangular Layouts / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Floor-Plan of Plane Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal Drawings for Plane Graphs with Specified Face Areas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rectangular duals of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact floor-planning via orderly spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Weighted Contact Representations of Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal module sizing in VLSI floorplanning by nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Diagrams Representing Maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rectangular cartograms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Floorplans, planar graphs, and layouts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Floor-Planning by Graph Dualization: 2-Concave Rectilinear Modules / rank
 
Normal rank

Latest revision as of 00:06, 7 July 2024

scientific article; zbMATH DE number 6223065
Language Label Description Also known as
English
Computing cartograms with optimal complexity
scientific article; zbMATH DE number 6223065

    Statements

    Computing cartograms with optimal complexity (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    6 November 2013
    0 references
    planar graphs
    0 references
    geometric representations
    0 references
    contact graphs
    0 references
    cartograms
    0 references
    0 references

    Identifiers

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