Minimum degree orderings (Q848936): Difference between revisions

@@ Property / DOI @@
-.1007/s00453-008-9239-2
@@ Property / DOI: 10.1007/s00453-008-9239-2 / rank @@
-Normal rank
@@ 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/s00453-008-9239-2
+Normal rank
@@ Property / OpenAlex ID @@
+W2170044697
@@ Property / OpenAlex ID: W2170044697 / rank @@
+Normal rank
@@ Property / cites work @@
+A correctness certificate for the Stoer-Wagner min-cut algorithm
+Normal rank
@@ Property / cites work @@
+Augmenting Undirected Edge Connectivity in Õ(n2) Time
+Normal rank
@@ Property / cites work @@
+Q5501810
@@ Property / cites work: Q5501810 / rank @@
+Normal rank
@@ Property / cites work @@
+Multi-Terminal Network Flows
@@ Property / cites work: Multi-Terminal Network Flows / rank @@
+Normal rank
@@ Property / cites work @@
+A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
+Normal rank
@@ Property / cites work @@
+Minimum cuts in near-linear time
@@ Property / cites work: Minimum cuts in near-linear time / rank @@
+Normal rank
@@ Property / cites work @@
+A new approach to the minimum cut problem
@@ Property / cites work: A new approach to the minimum cut problem / rank @@
+Normal rank
@@ Property / cites work @@
+Cutsets and partitions of hypergraphs
@@ Property / cites work: Cutsets and partitions of hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+<i>k</i>-Components, Clusters and Slicings in Graphs
+Normal rank
@@ Property / cites work @@
+Smallest-last ordering and clustering and graph coloring algorithms
+Normal rank
@@ Property / cites work @@
+GRAPH ALGORITHMS FOR NETWORK CONNECTIVITY PROBLEMS(&lt;Special Issue&gt;Network Design, Control and Optimization)
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
+Normal rank
@@ Property / cites work @@
+Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
+Normal rank
@@ Property / cites work @@
+A note on minimizing submodular functions
@@ Property / cites work: A note on minimizing submodular functions / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum cost subpartitions in graphs
@@ Property / cites work: Minimum cost subpartitions in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Fast Algorithm for Optimally Increasing the Edge Connectivity
+Normal rank
@@ Property / cites work @@
+Minimizing symmetric submodular functions
@@ Property / cites work: Minimizing symmetric submodular functions / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum Cost Source Location Problems with Flow Requirements
+Normal rank
@@ Property / cites work @@
+A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
+Normal rank
@@ Property / cites work @@
+A simple min-cut algorithm
@@ Property / cites work: A simple min-cut algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-connectivity augmentation problems
@@ Property / cites work: Edge-connectivity augmentation problems / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S00453-008-9239-2
@@ Property / DOI: 10.1007/S00453-008-9239-2 / rank @@
+Normal rank