Packing Steiner trees (Q273179): Difference between revisions

@@ Property / DOI @@
-.1016/j.jctb.2016.02.002
@@ Property / DOI: 10.1016/j.jctb.2016.02.002 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1899569194
@@ Property / OpenAlex ID: W1899569194 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.7621
@@ Property / arXiv ID: 1307.7621 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5684698
@@ Property / cites work: Q5684698 / rank @@
+Normal rank
@@ Property / cites work @@
+On decomposing a hypergraph into \(k\) connected sub-hypergraphs
+Normal rank
@@ Property / cites work @@
+An approximate max-Steiner-tree-packing min-Steiner-cut theorem
+Normal rank
@@ Property / cites work @@
+Q4091971
@@ Property / cites work: Q4091971 / rank @@
+Normal rank
@@ Property / cites work @@
+Degree Bounded Matroids and Submodular Flows
@@ Property / cites work: Degree Bounded Matroids and Submodular Flows / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-disjoint trees containing some given vertices in a graph
+Normal rank
@@ Property / cites work @@
+A Reduction Method for Edge-Connectivity in Graphs
+Normal rank
@@ Property / cites work @@
+Edge-Disjoint Spanning Trees of Finite Graphs
@@ Property / cites work: Edge-Disjoint Spanning Trees of Finite Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A THEOREM ON INDEPENDENCE RELATIONS
@@ Property / cites work: A THEOREM ON INDEPENDENCE RELATIONS / rank @@
+Normal rank
@@ Property / cites work @@
+On the Problem of Decomposing a Graph into <i>n</i>  Connected Factors
+Normal rank
@@ Property / cites work @@
+Packing of Steiner trees and \(S\)-connectors in graphs
+Normal rank
@@ Property / DOI @@
+.1016/J.JCTB.2016.02.002
@@ Property / DOI: 10.1016/J.JCTB.2016.02.002 / rank @@
+Normal rank