Packing Steiner trees on four terminals (Q602710): 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.1016/j.jctb.2010.04.003
+Normal rank
@@ Property / OpenAlex ID @@
+W2074699475
@@ Property / OpenAlex ID: W2074699475 / rank @@
+Normal rank
@@ Property / cites work @@
+Hardness and approximation results for packing Steiner trees
+Normal rank
@@ Property / cites work @@
+Q5315023
@@ Property / cites work: Q5315023 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4471308
@@ Property / cites work: Q4471308 / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-disjoint trees containing some given vertices in a graph
+Normal rank
@@ Property / cites work @@
+Edge disjoint Steiner trees in graphs without large bridges
+Normal rank
@@ Property / cites work @@
+An approximate max-Steiner-tree-packing min-Steiner-cut theorem
+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 @@
+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
@@ links / mardi / name / links / mardi / name @@
+Publication:602710