January 01, 1991 conference-paper A matroid approach to finding edge connectivity and packing arborescences ACM Symposium on Theory of Computing (STOC) DOI: 10.1145/103418.103436 OpenAlex Authors 0 Author list not loaded yet. Cited by 1 stored of 196 Search Sort Most cited Newest Oldest Patent citations Title Any typearticle review book-chapter conference-paper preprint dissertation book dataset other Any fieldAgricultural and Biological Sciences Arts and Humanities Biochemistry, Genetics and Molecular Biology Business, Management and Accounting Chemical Engineering Chemistry Computer Science Decision Sciences Dentistry Earth and Planetary Sciences Economics, Econometrics and Finance Energy Engineering Environmental Science Health Professions Immunology and Microbiology Materials Science Mathematics Medicine Neuroscience Nursing Pharmacology, Toxicology and Pharmaceutics Physics and Astronomy Psychology Social Sciences Veterinary Open access Low Recourse Arborescence Forests Under Uniformly Random Arcs 2025 Lecture notes in computer science conference-paper Computer Science Complexity and Algorithms in Graphs 0 citations 1 result References 0