Crossing edge minimization in radial outerplanar layered graphs using segment paths (Q6065215): Difference between revisions

@@ Property / cites work @@
+Contact Graphs of Circular Arcs
@@ Property / cites work: Contact Graphs of Circular Arcs / rank @@
+Normal rank
@@ Property / cites work @@
+Obstacle numbers of graphs
@@ Property / cites work: Obstacle numbers of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for NP-complete problems on planar graphs
+Normal rank
@@ Property / cites work @@
+Towards a Topology-Shape-Metrics Framework for Ortho-Radial Drawings
+Normal rank
@@ Property / cites work @@
+Graph-Theoretic Concepts in Computer Science
@@ Property / cites work: Graph-Theoretic Concepts in Computer Science / rank @@
+Normal rank
@@ Property / cites work @@
+Untangling circular drawings: algorithms and complexity
+Normal rank
@@ Property / cites work @@
+Q4471340
@@ Property / cites work: Q4471340 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3651735
@@ Property / cites work: Q3651735 / rank @@
+Normal rank
@@ Property / cites work @@
+Drawing Graphs with Right Angle Crossings
@@ Property / cites work: Drawing Graphs with Right Angle Crossings / rank @@
+Normal rank
@@ Property / cites work @@
+Edge crossings in drawings of bipartite graphs
@@ Property / cites work: Edge crossings in drawings of bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5404510
@@ Property / cites work: Q5404510 / rank @@
+Normal rank
@@ Property / cites work @@
+Convex Obstacle Numbers of Outerplanar Graphs and Bipartite Permutation Graphs
+Normal rank
@@ Property / cites work @@
+Crossing Number is NP-Complete
@@ Property / cites work: Crossing Number is NP-Complete / rank @@
+Normal rank
@@ Property / cites work @@
+Classes and recognition of curve contact graphs
@@ Property / cites work: Classes and recognition of curve contact graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Experimental Evaluation of Book Drawing Algorithms
+Normal rank
@@ Property / cites work @@
+The crossing number of K5,n
@@ Property / cites work: The crossing number of K5,n / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing crossings in constrained two-sided circular graph layouts.
+Normal rank
@@ Property / cites work @@
+Are Crossings Important for Drawing Large Graphs?
@@ Property / cites work: Are Crossings Important for Drawing Large Graphs? / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizations and recognition of circular-arc graphs and subclasses: a survey
+Normal rank
@@ Property / cites work @@
+Efficient Algorithms for Ortho-Radial Graph Drawing.
+Normal rank
@@ Property / cites work @@
+Circular right-angle crossing drawings in linear time
+Normal rank
@@ Property / cites work @@
+The graph crossing number and its variants: a survey
+Normal rank
@@ Property / cites work @@
+Q4089424
@@ Property / cites work: Q4089424 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5558480
@@ Property / cites work: Q5558480 / rank @@
+Normal rank