An effective crossing minimisation heuristic based on star insertion (Q3121515): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2963557107
@@ Property / OpenAlex ID: W2963557107 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.09900
@@ Property / arXiv ID: 1804.09900 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Drawing
@@ Property / cites work: Graph Drawing / rank @@
+Normal rank
@@ Property / cites work @@
+Crossing number and weighted crossing number of near-planar graphs
+Normal rank
@@ Property / cites work @@
+Adding One Edge to Planar Graphs Makes Crossing Number and 1-Planarity Hard
+Normal rank
@@ Property / cites work @@
+Advances in the Planarization Method: Effective Multiple Edge Insertions
+Normal rank
@@ Property / cites work @@
+Experiments on Exact Crossing Minimization Using Column Generation
+Normal rank
@@ Property / cites work @@
+Q4633846
@@ Property / cites work: Q4633846 / rank @@
+Normal rank
@@ Property / cites work @@
+A tighter insertion-based approximation of the crossing number
+Normal rank
@@ Property / cites work @@
+Vertex insertion approximates the crossing number of apex graphs
+Normal rank
@@ Property / cites work @@
+Q5365099
@@ Property / cites work: Q5365099 / rank @@
+Normal rank
@@ Property / cites work @@
+How to draw a planar graph on a grid
@@ Property / cites work: How to draw a planar graph on a grid / rank @@
+Normal rank
@@ Property / cites work @@
+An experimental comparison of four graph drawing algorithms.
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Finding a Maximal Planar Subgraph
+Normal rank
@@ Property / cites work @@
+Q4551610
@@ Property / cites work: Q4551610 / rank @@
+Normal rank
@@ Property / cites work @@
+The crossing numbers of some generalized Petersen 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 @@
+Graph Drawing
@@ Property / cites work: Graph Drawing / rank @@
+Normal rank
@@ Property / cites work @@
+Inserting an edge into a planar graph
@@ Property / cites work: Inserting an edge into a planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Drawing
@@ Property / cites work: Graph Drawing / rank @@
+Normal rank
@@ Property / cites work @@
+On the Crossing Number of Almost Planar Graphs
@@ Property / cites work: On the Crossing Number of Almost Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithm for drawing general undirected graphs
+Normal rank
@@ Property / cites work @@
+Q3866146
@@ Property / cites work: Q3866146 / rank @@
+Normal rank
@@ Property / cites work @@
+The crossing number of <i>K</i><sub>11</sub> is 100
+Normal rank
@@ Property / cites work @@
+Inserting an edge into a geometric embedding
@@ Property / cites work: Inserting an edge into a geometric embedding / rank @@
+Normal rank
@@ Property / cites work @@
+Q3138887
@@ Property / cites work: Q3138887 / rank @@
+Normal rank
@@ Property / cites work @@
+On a problem of P. Turan concerning graphs
@@ Property / cites work: On a problem of P. Turan concerning graphs / rank @@
+Normal rank