Work

Random Sampling in Matroids, with Applications to Graph Connectivity and Minimum Spanning Trees

Type: article

Author: David R. Karger

Institution: Stanford University

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W3143927905

Cites: 21

Cited by: 1

Related to: 9