Algorithms for area-efficient orthogonal drawing (Q1384191): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A better heuristic for orthogonal graph drawings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On pairwise compatibility graphs having Dilworth number two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for drawing graphs: An annotated bibliography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3883524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing an st-numbering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient orthogonal drawings of high degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing graphs on rectangular grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimal-node-cost planar embeddings / 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: Lower bounds for planar orthogonal drawings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universality considerations in VLSI circuits / rank
 
Normal rank

Revision as of 12:07, 28 May 2024

scientific article
Language Label Description Also known as
English
Algorithms for area-efficient orthogonal drawing
scientific article

    Statements

    Identifiers