Cache oblivious minimum cut

DOI10.1007/978-3-319-57586-5_24zbMATH Open1486.68131OpenAlexW2606003984MaRDI QIDQ5283375FDOQ5283375

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

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

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

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)