Packing algorithms for arborescences (and spanning trees) in capacitated graphs (Q5101431): 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.1007/3-540-59408-6_67
+Normal rank
@@ Property / OpenAlex ID @@
+W2171842972
@@ Property / OpenAlex ID: W2171842972 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum partition of a matroid into independent subsets
+Normal rank
@@ Property / cites work @@
+Q4744300
@@ Property / cites work: Q4744300 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3859792
@@ Property / cites work: Q3859792 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4886037
@@ Property / cites work: Q4886037 / rank @@
+Normal rank
@@ Property / cites work @@
+Geometric algorithms and combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Forests, frames, and games: Algorithms for matroid sums and applications
+Normal rank
@@ Property / cites work @@
+A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
+Normal rank
@@ Property / cites work @@
+NETWORK-FLOW ALGORITHMS FOR LOWER-TRUNCATED TRANSVERSAL POLYMATROIDS
+Normal rank
@@ Property / cites work @@
+On two minimax theorems in graph
@@ Property / cites work: On two minimax theorems in graph / rank @@
+Normal rank
@@ Property / cites work @@
+On N–Edge–Connected Digraphs
@@ Property / cites work: On N–Edge–Connected Digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Arc‐disjoint arborescences of digraphs
@@ Property / cites work: Arc‐disjoint arborescences of digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Fractional covers for forests and matchings
@@ Property / cites work: Fractional covers for forests and matchings / rank @@
+Normal rank
@@ Property / cites work @@
+Q4228440
@@ Property / cites work: Q4228440 / rank @@
+Normal rank
@@ Property / cites work @@
+A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
+Normal rank
@@ Property / cites work @@
+Edge-disjoint branching in directed multigraphs
@@ Property / cites work: Edge-disjoint branching in directed multigraphs / rank @@
+Normal rank
@@ Property / cites work @@
+A good algorithm for edge-disjoint branching
@@ Property / cites work: A good algorithm for edge-disjoint branching / rank @@
+Normal rank
@@ Property / cites work @@
+Q3701198
@@ Property / cites work: Q3701198 / rank @@
+Normal rank
@@ Property / cites work @@
+Strength and reinforcement of a network and tree packing
+Normal rank
@@ Property / cites work @@
+Strength of a graph and packing of trees and branchings
+Normal rank
@@ Property / cites work @@
+A faster algorithm for finding edge-disjoint branchings
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5101431