Rooted \(k\)-connections in digraphs (Q1025990): Difference between revisions

@@ Property / DOI @@
-.1016/j.dam.2008.03.040
@@ Property / DOI: 10.1016/j.dam.2008.03.040 / rank @@
-Normal rank
@@ 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.dam.2008.03.040
+Normal rank
@@ Property / OpenAlex ID @@
+W2015382802
@@ Property / OpenAlex ID: W2015382802 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5567717
@@ Property / cites work: Q5567717 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5684698
@@ Property / cites work: Q5684698 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum partition of a matroid into independent subsets
+Normal rank
@@ Property / cites work @@
+Matroid Intersection
@@ Property / cites work: Matroid Intersection / rank @@
+Normal rank
@@ Property / cites work @@
+Transversals and matroid partition
@@ Property / cites work: Transversals and matroid partition / rank @@
+Normal rank
@@ Property / cites work @@
+Q4149476
@@ Property / cites work: Q4149476 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5514188
@@ Property / cites work: Q5514188 / rank @@
+Normal rank
@@ Property / cites work @@
+Packing rooted directed cuts in a weighted directed graph
+Normal rank
@@ Property / cites work @@
+Q3859792
@@ Property / cites work: Q3859792 / rank @@
+Normal rank
@@ Property / cites work @@
+A weighted matroid intersection algorithm
@@ Property / cites work: A weighted matroid intersection algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Q3684133
@@ Property / cites work: Q3684133 / rank @@
+Normal rank
@@ Property / cites work @@
+An application of submodular flows
@@ Property / cites work: An application of submodular flows / rank @@
+Normal rank
@@ Property / cites work @@
+Increasing the rooted connectivity of a digraph by one
+Normal rank
@@ Property / cites work @@
+Q3220319
@@ Property / cites work: Q3220319 / rank @@
+Normal rank
@@ Property / cites work @@
+Submodular functions and optimization.
@@ Property / cites work: Submodular functions and optimization. / rank @@
+Normal rank
@@ Property / cites work @@
+Q5722271
@@ Property / cites work: Q5722271 / rank @@
+Normal rank
@@ Property / cites work @@
+On the degrees of the vertices of a directed graph
+Normal rank
@@ Property / cites work @@
+On combinatorial structures of line drawings of polyhedra
+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 @@
+Decomposition of Finite Graphs Into Forests
@@ Property / cites work: Decomposition of Finite Graphs Into Forests / rank @@
+Normal rank
@@ Property / cites work @@
+Q3330974
@@ Property / cites work: Q3330974 / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank
@@ Property / cites work @@
+Detection of structural inconsistency in systems of equations with degrees of freedom and its applications
+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 @@
+Q4717849
@@ Property / cites work: Q4717849 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.DAM.2008.03.040
@@ Property / DOI: 10.1016/J.DAM.2008.03.040 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1025990