Suboptimal cuts: Their enumeration, weight and number (Q5204331): 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/3-540-55719-9_88
+Normal rank
@@ Property / OpenAlex ID @@
+W1542177083
@@ Property / OpenAlex ID: W1542177083 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3292914
@@ Property / cites work: Q3292914 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3138919
@@ Property / cites work: Q3138919 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient algorithm for finding all minimal edge cuts of a nonoriented graph
+Normal rank
@@ Property / cites work @@
+A Procedure for Computing the <i>K</i> Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
+Normal rank
@@ Property / cites work @@
+Q4037426
@@ Property / cites work: Q4037426 / rank @@
+Normal rank
@@ Property / cites work @@
+On the structure of all minimum cuts in a network and applications
+Normal rank
@@ Property / cites work @@
+The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5204331