Finding Triangles for Maximum Planar Subgraphs (Q2980925): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-319-53925-6_29
+Normal rank
@@ Property / OpenAlex ID @@
+W2625058834
@@ Property / OpenAlex ID: W2625058834 / rank @@
+Normal rank
@@ Property / cites work @@
+An $O(m\log n)$-Time Algorithm for the Maximal Planar Subgraph Problem
+Normal rank
@@ Property / cites work @@
+A Better Approximation Algorithm for Finding Planar Subgraphs
+Normal rank
@@ Property / cites work @@
+A new approximation algorithm for finding heavy planar subgraphs
+Normal rank
@@ Property / cites work @@
+Maximum series-parallel subgraph
@@ Property / cites work: Maximum series-parallel subgraph / rank @@
+Normal rank
@@ Property / cites work @@
+The sizes of maximal planar, outerplanar, and bipartite planar subgraphs
+Normal rank
@@ Property / cites work @@
+On the complexity of the approximation of nonplanarity parameters for cubic graphs
+Normal rank
@@ Property / cites work @@
+Handbook of Approximation Algorithms and Metaheuristics
+Normal rank
@@ Property / cites work @@
+Large planar subgraphs in dense graphs
@@ Property / cites work: Large planar subgraphs in dense graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3866146
@@ Property / cites work: Q3866146 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3615285
@@ Property / cites work: Q3615285 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3102944
@@ Property / cites work: Q3102944 / rank @@
+Normal rank