An exact algorithm for solving the vertex separator problem (Q628743): Difference between revisions

@@ Property / DOI @@
-.1007/s10898-010-9568-y
@@ Property / DOI: 10.1007/s10898-010-9568-y / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10898-010-9568-y
+Normal rank
@@ Property / OpenAlex ID @@
+W1967802975
@@ Property / OpenAlex ID: W1967802975 / rank @@
+Normal rank
@@ Property / cites work @@
+The vertex separator problem: a polyhedral investigation
+Normal rank
@@ Property / cites work @@
+Finding good approximate vertex and edge partitions is NP-hard
+Normal rank
@@ Property / cites work @@
+On implementing the push-relabel method for the maximum flow problem
+Normal rank
@@ Property / cites work @@
+The vertex separator problem: algorithms and computations
+Normal rank
@@ Property / cites work @@
+Algorithms and Computation
@@ Property / cites work: Algorithms and Computation / rank @@
+Normal rank
@@ Property / cites work @@
+NP-completeness of the Planar Separator Problems
@@ Property / cites work: NP-completeness of the Planar Separator Problems / rank @@
+Normal rank
@@ Property / cites work @@
+A Separator Theorem for Planar Graphs
@@ Property / cites work: A Separator Theorem for Planar Graphs / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S10898-010-9568-Y
@@ Property / DOI: 10.1007/S10898-010-9568-Y / rank @@
+Normal rank