Branch-and-bound techniques for the maximum planar subgraph problem<sup>∗</sup> (Q4844576): Difference between revisions

@@ Property / cites work @@
+A linear algorithm for embedding planar graphs using PQ-trees
+Normal rank
@@ Property / cites work @@
+Finding a Maximum Clique in an Arbitrary Graph
@@ Property / cites work: Finding a Maximum Clique in an Arbitrary Graph / rank @@
+Normal rank
@@ 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 @@
+An analysis of heuristics for graph planarization
@@ Property / cites work: An analysis of heuristics for graph planarization / rank @@
+Normal rank
@@ Property / cites work @@
+Facilities Layout Adjacency Determination: An Experimental Comparison of Three Graph Theoretic Heuristics
+Normal rank
@@ Property / cites work @@
+On linear-time algorithms for five-coloring planar graphs
+Normal rank
@@ Property / cites work @@
+An efficient graph planarization two‐phase heuristic
+Normal rank
@@ Property / cites work @@
+Efficient Planarity Testing
@@ Property / cites work: Efficient Planarity Testing / rank @@
+Normal rank
@@ Property / cites work @@
+An Efficient Heuristic Procedure for Partitioning Graphs
+Normal rank
@@ Property / cites work @@
+A batching method for coloring planar graphs
@@ Property / cites work: A batching method for coloring planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3866146
@@ Property / cites work: Q3866146 / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithm for finding a maximum weighted independent set in an arbitrary graph
+Normal rank
@@ Property / cites work @@
+Finding a Maximum Independent Set
@@ Property / cites work: Finding a Maximum Independent Set / rank @@
+Normal rank