Crossing and Weighted Crossing Number of Near-Planar Graphs (Q3611835): 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.1007/978-3-642-00219-9_5
+Normal rank
@@ Property / OpenAlex ID @@
+W2129252388
@@ Property / OpenAlex ID: W2129252388 / rank @@
+Normal rank
@@ Property / cites work @@
+A framework for solving VLSI graph layout problems
+Normal rank
@@ Property / cites work @@
+The Minor Crossing Number
@@ Property / cites work: The Minor Crossing Number / 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 @@
+Q4198056
@@ Property / cites work: Q4198056 / 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 @@
+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 @@
+Q2702747
@@ Property / cites work: Q2702747 / rank @@
+Normal rank
@@ Property / cites work @@
+New lower bound techniques for VLSI
@@ Property / cites work: New lower bound techniques for VLSI / rank @@
+Normal rank
@@ Property / cites work @@
+Planarizing Graphs - A Survey and Annotated Bibliography
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for finding an ambitus
@@ Property / cites work: A linear-time algorithm for finding an ambitus / rank @@
+Normal rank
@@ Property / cites work @@
+Q2726740
@@ Property / cites work: Q2726740 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3418609
@@ Property / cites work: Q3418609 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4879104
@@ Property / cites work: Q4879104 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4352316
@@ Property / cites work: Q4352316 / rank @@
+Normal rank
@@ Property / cites work @@
+A successful concept for measuring non-planarity of graphs: The crossing number.
+Normal rank
@@ Property / cites work @@
+Separation of vertices by a circuit
@@ Property / cites work: Separation of vertices by a circuit / rank @@
+Normal rank
@@ Property / cites work @@
+A note on isoperimetric peaks of complete trees
@@ Property / cites work: A note on isoperimetric peaks of complete trees / rank @@
+Normal rank