Cache Oblivious Minimum Cut

DOI10.1007/978-3-319-57586-5_24zbMath1486.68131OpenAlexW2606003984MaRDI QIDQ5283375

Barbara Geissmann, Lukas Gianinazzi

Publication date: 21 July 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-57586-5_24

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• I/O efficient algorithms for the minimum cut problem on unweighted undirected graphs
• Deterministic Global Minimum Cut of a Simple Graph in Near-Linear Time
• Cache-Oblivious Algorithms
• On the limits of cache-obliviousness
• On the Limits of Cache-Oblivious Matrix Transposition
• On Finding Lowest Common Ancestors: Simplification and Parallelization
• Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
• A new approach to the minimum cut problem
• A simple min-cut algorithm
• Algorithm Theory - SWAT 2004
• An Optimal Cache‐Oblivious Priority Queue and Its Application to Graph Algorithms
• Minimum cuts in near-linear time