A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs (Q1266546): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0377-2217(95)00356-8
+Normal rank
@@ Property / OpenAlex ID @@
+W2080431890
@@ Property / OpenAlex ID: W2080431890 / rank @@
+Normal rank
@@ Property / cites work @@
+Hierarchies and planarity theory
@@ Property / cites work: Hierarchies and planarity theory / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for drawing graphs: An annotated bibliography
+Normal rank
@@ Property / cites work @@
+Q3731621
@@ Property / cites work: Q3731621 / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-completeness column: An ongoing gulde
@@ Property / cites work: The NP-completeness column: An ongoing gulde / rank @@
+Normal rank
@@ Property / cites work @@
+Experiments on drawing 2-level hierarchical graphs
+Normal rank
@@ Property / cites work @@
+Q4144192
@@ Property / cites work: Q4144192 / rank @@
+Normal rank
@@ Property / cites work @@
+Crossing Theory and Hierarchy Mapping
@@ Property / cites work: Crossing Theory and Hierarchy Mapping / rank @@
+Normal rank