Packing the Steiner trees of a graph (Q3057108): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1002/net.20298
@@ Property / full work available at URL: https://doi.org/10.1002/net.20298 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W4248918285
@@ Property / OpenAlex ID: W4248918285 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal attack and reinforcement of a network
@@ Property / cites work: Optimal attack and reinforcement of a network / rank @@
+Normal rank
@@ Property / cites work @@
+On decomposing a hypergraph into \(k\) connected sub-hypergraphs
+Normal rank
@@ Property / cites work @@
+Packing Steiner trees: Polyhedral investigations
@@ Property / cites work: Packing Steiner trees: Polyhedral investigations / rank @@
+Normal rank
@@ Property / cites work @@
+The Steiner tree packing problem in VLSI design
@@ Property / cites work: The Steiner tree packing problem in VLSI design / rank @@
+Normal rank
@@ Property / cites work @@
+Connectivity and edge-disjoint spanning trees
@@ Property / cites work: Connectivity and edge-disjoint spanning trees / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-disjoint trees containing some given vertices in a graph
+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 @@
+Q2716516
@@ Property / cites work: Q2716516 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Problem of Decomposing a Graph into <i>n</i>  Connected Factors
+Normal rank