Maximum planar subgraphs and nice embeddings: Practical layout tools (Q1920420): Difference between revisions

@@ Property / cites work @@
+Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
+Normal rank
@@ Property / cites work @@
+An $O(m\log n)$-Time Algorithm for the Maximal Planar Subgraph Problem
+Normal rank
@@ Property / cites work @@
+Q4750667
@@ Property / cites work: Q4750667 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph theory applications
@@ Property / cites work: Graph theory applications / rank @@
+Normal rank
@@ Property / cites work @@
+A Strategy for Solving the Plant Layout Problem
@@ Property / cites work: A Strategy for Solving the Plant Layout Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient graph planarization two‐phase heuristic
+Normal rank
@@ Property / cites work @@
+A Cutting Plane Algorithm for the Linear Ordering Problem
+Normal rank
@@ Property / cites work @@
+Efficient Planarity Testing
@@ Property / cites work: Efficient Planarity Testing / rank @@
+Normal rank
@@ Property / cites work @@
+Provably good solutions for the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+A New Graph-Theoretic Heuristic for Facility Layout
+Normal rank
@@ Property / cites work @@
+Q3866146
@@ Property / cites work: Q3866146 / rank @@
+Normal rank
@@ Property / cites work @@
+A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
+Normal rank