On finding two-connected subgraphs in planar graphs (Q1376267): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal connected enclosures on an embedded planar graph
+Normal rank
@@ Property / cites work @@
+Send-and-Split Method for Minimum-Concave-Cost Network Flows
+Normal rank
@@ Property / cites work @@
+The Planar Hamiltonian Circuit Problem is NP-Complete
+Normal rank
@@ Property / cites work @@
+Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
+Normal rank
@@ Property / cites work @@
+The Steiner tree problem
@@ Property / cites work: The Steiner tree problem / rank @@
+Normal rank
@@ Property / cites work @@
+Biconnectivity approximations and graph carvings
@@ Property / cites work: Biconnectivity approximations and graph carvings / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum-weight two-connected spanning networks
@@ Property / cites work: Minimum-weight two-connected spanning networks / rank @@
+Normal rank
@@ Property / cites work @@
+Convexity and the Steiner tree problem
@@ Property / cites work: Convexity and the Steiner tree problem / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest enclosing walks and cycles in embedded graphs
+Normal rank
@@ Property / cites work @@
+Generalized steiner problem in series-parallel networks
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1376267