A rearrangement of adjacency matrix based approach for solving the crossing minimization problem (Q411236): Difference between revisions

@@ Property / describes a project that uses @@
+Concorde
@@ Property / describes a project that uses: Concorde / rank @@
+Normal rank
@@ 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.1007/s10878-010-9326-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2094686363
@@ Property / OpenAlex ID: W2094686363 / rank @@
+Normal rank
@@ Property / cites work @@
+Exact Algorithms for the Quadratic Linear Ordering Problem
+Normal rank
@@ Property / cites work @@
+Crossing Minimization in Weighted Bipartite 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 @@
+-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
+Normal rank
@@ Property / cites work @@
+GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
+Normal rank
@@ Property / cites work @@
+Heuristics and meta-heuristics for 2-layer straight line crossing minimization
+Normal rank
@@ Property / cites work @@
+Q3043710
@@ Property / cites work: Q3043710 / rank @@
+Normal rank
@@ Property / cites work @@
+A tabu thresholding algorithm for arc crossing minimization in bipartite graphs
+Normal rank
@@ Property / cites work @@
+A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs
+Normal rank