On the Hardness and Approximability of Planar Biconnectivity Augmentation (Q5323069): 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-02882-3_25
+Normal rank
@@ Property / OpenAlex ID @@
+W1560695543
@@ Property / OpenAlex ID: W1560695543 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4037427
@@ Property / cites work: Q4037427 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4250191
@@ Property / cites work: Q4250191 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding a Smallest Augmentation to Biconnect a Graph
+Normal rank
@@ Property / cites work @@
+Dividing a Graph into Triconnected Components
@@ Property / cites work: Dividing a Graph into Triconnected Components / rank @@
+Normal rank
@@ Property / cites work @@
+On-Line Planarity Testing
@@ Property / cites work: On-Line Planarity Testing / rank @@
+Normal rank
@@ Property / cites work @@
+Q4472293
@@ Property / cites work: Q4472293 / rank @@
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank