New bounds on the barycenter heuristic for bipartite graph drawing. (Q1853018): Difference between revisions

@@ Property / cites work @@
+Q3154375
@@ Property / cites work: Q3154375 / rank @@
+Normal rank
@@ Property / cites work @@
+Drawing graphs in two layers
@@ Property / cites work: Drawing graphs in two layers / 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 @@
+Crossing Number is NP-Complete
@@ Property / cites work: Crossing Number is NP-Complete / rank @@
+Normal rank
@@ Property / cites work @@
+Trees with Hamiltonian square
@@ Property / cites work: Trees with Hamiltonian square / rank @@
+Normal rank
@@ Property / cites work @@
+Q5677508
@@ Property / cites work: Q5677508 / rank @@
+Normal rank
@@ Property / cites work @@
+-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
+Normal rank
@@ Property / cites work @@
+Experiments on drawing 2-level hierarchical graphs
+Normal rank
@@ Property / cites work @@
+Q4505705
@@ Property / cites work: Q4505705 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0020-0190(01)00297-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2014942297
@@ Property / OpenAlex ID: W2014942297 / rank @@
+Normal rank