June 06, 2001 article A new—old algorithm for minimum‐cut and maximum‐flow in closure graphs Networks DOI: 10.1002/net.1012 OpenAlex Authors 0 Author list not loaded yet. Cited by 2 stored of 96 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 Privacy-Preserving Breadth-First-Search and Maximal Flow 2023 Workshop on Privacy in the Electronic Society conference-paper Computer Science Privacy-Preserving Technologies in Data 0 citations Stackelberg Max Closure with Multiple Followers 2022 Mathematics of Operations Research article Computer Science Complexity and Algorithms in Graphs Open access 3 citations 2 results References 0