Orthogonal graph drawing with flexibility constraints (Q476441): Difference between revisions

@@ Property / cites work @@
+A better heuristic for orthogonal graph drawings
@@ Property / cites work: A better heuristic for orthogonal graph drawings / rank @@
+Normal rank
@@ Property / cites work @@
+Spirality and Optimal Orthogonal Drawings
@@ Property / cites work: Spirality and Optimal Orthogonal Drawings / rank @@
+Normal rank
@@ Property / cites work @@
+On-line maintenance of triconnected components with SPQR-trees
+Normal rank
@@ Property / cites work @@
+On-Line Planarity Testing
@@ Property / cites work: On-Line Planarity Testing / rank @@
+Normal rank
@@ Property / cites work @@
+Maximal Flow Through a Network
@@ Property / cites work: Maximal Flow Through a Network / rank @@
+Normal rank
@@ Property / cites work @@
+On the Computational Complexity of Upward and Rectilinear Planarity Testing
+Normal rank
@@ Property / cites work @@
+Q4472293
@@ Property / cites work: Q4472293 / rank @@
+Normal rank
@@ Property / cites work @@
+Faster shortest-path algorithms for planar graphs
@@ Property / cites work: Faster shortest-path algorithms for planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Theoretical results on at most 1-bend embeddability of graphs
+Normal rank
@@ Property / cites work @@
+A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid
+Normal rank
@@ Property / cites work @@
+Flow in Planar Graphs with Multiple Sources and Sinks
+Normal rank
@@ Property / cites work @@
+An algorithm for 1-bend embeddings of plane graphs in the two-dimensional grid
+Normal rank
@@ Property / cites work @@
+On Embedding a Graph in the Grid with the Minimum Number of Bends
+Normal rank