Steiner connectivity problems in hypergraphs (Q6072212): Difference between revisions

@@ Property / cites work @@
+An improved LP-based approximation for steiner tree
+Normal rank
@@ Property / cites work @@
+The steiner problem in graphs
@@ Property / cites work: The steiner problem in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the orientation of graphs and hypergraphs
@@ Property / cites work: On the orientation of graphs and hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+On decomposing a hypergraph into \(k\) connected sub-hypergraphs
+Normal rank
@@ Property / cites work @@
+The disjoint paths problem in quadratic time
@@ Property / cites work: The disjoint paths problem in quadratic time / rank @@
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Packing Steiner trees with identical terminal sets
+Normal rank
@@ Property / cites work @@
+A fast algorithm for Steiner trees
@@ Property / cites work: A fast algorithm for Steiner trees / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-disjoint trees containing some given vertices in a graph
+Normal rank
@@ Property / cites work @@
+Q4091971
@@ Property / cites work: Q4091971 / rank @@
+Normal rank
@@ Property / cites work @@
+On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
+Normal rank
@@ Property / cites work @@
+Graph minors. XIII: The disjoint paths problem
@@ Property / cites work: Graph minors. XIII: The disjoint paths problem / rank @@
+Normal rank
@@ Property / cites work @@
+Packing of Steiner trees and \(S\)-connectors in graphs
+Normal rank