Orthogonal drawing of high degree graphs with small area and few bends (Q5096952): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-63307-3_74
+Normal rank
@@ Property / OpenAlex ID @@
+W1593961019
@@ Property / OpenAlex ID: W1593961019 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for drawing graphs: An annotated bibliography
+Normal rank
@@ Property / cites work @@
+An experimental comparison of four graph drawing algorithms.
+Normal rank
@@ Property / cites work @@
+Computing an st-numbering
@@ Property / cites work: Computing an st-numbering / rank @@
+Normal rank
@@ Property / cites work @@
+Drawing planar graphs using the canonical ordering
+Normal rank
@@ Property / cites work @@
+Q5596083
@@ Property / cites work: Q5596083 / rank @@
+Normal rank
@@ Property / cites work @@
+Graphs drawn with few crossings per edge
@@ Property / cites work: Graphs drawn with few crossings per edge / rank @@
+Normal rank
@@ Property / cites work @@
+Drawing graphs on rectangular grids
@@ Property / cites work: Drawing graphs on rectangular grids / rank @@
+Normal rank
@@ Property / cites work @@
+On minimal-node-cost planar embeddings
@@ Property / cites work: On minimal-node-cost planar embeddings / rank @@
+Normal rank
@@ Property / cites work @@
+On Embedding a Graph in the Grid with the Minimum Number of Bends
+Normal rank