Cache oblivious minimum cut

DOI10.1007/978-3-319-57586-5_24MaRDI QIDQ5283375zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• I/O efficient algorithms for the minimum cut problem on unweighted undirected graphs
• I/O efficient algorithms for the minimum cut problem on unweighted undirected graphs
• A faster cache-oblivious shortest-path algorithm for undirected graphs with bounded edge lengths
• Fundamentals of Computation Theory
• A new approach to the minimum cut problem

Cites work

• 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
• Cache-oblivious algorithms
• Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
• Deterministic global minimum cut of a simple graph in near-linear time
• scientific article; zbMATH DE number 1617278 (Why is no real title available?)
• scientific article; zbMATH DE number 1305462 (Why is no real title available?)
• scientific article; zbMATH DE number 910869 (Why is no real title available?)
• I/O efficient algorithms for the minimum cut problem on unweighted undirected graphs
• Minimum cuts in near-linear time
• On Finding Lowest Common Ancestors: Simplification and Parallelization
• On the Limits of Cache-Oblivious Matrix Transposition
• On the limits of cache-obliviousness

Cited in

(2)

• Low-congestion shortcuts without embedding
• Automata, Languages and Programming

This page was built for publication: Cache oblivious minimum cut

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5283375)