Graph partitioning using single commodity flows
From MaRDI portal
Publication:5899510
DOI10.1145/1538902.1538903zbMath1325.05170OpenAlexW1984361668MaRDI QIDQ5899510
Rohit Khandekar, Satish B. Rao, Umesh V. Vazirani
Publication date: 11 November 2015
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1538902.1538903
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Flows in graphs (05C21)
Related Items (13)
Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance ⋮ Minimum-Cost Network Design with (Dis)economies of Scale ⋮ Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs ⋮ Constant Congestion Brambles ⋮ Fission: Practical algorithms for computing minimum balanced node separators ⋮ An Escape Time Formulation for Subgraph Detection and Partitioning of Directed Graphs ⋮ Unnamed Item ⋮ Towards tight(er) bounds for the excluded grid theorem ⋮ Unnamed Item ⋮ Local Flow Partitioning for Faster Edge Connectivity ⋮ Hallucination Helps: Energy Efficient Virtual Circuit Routing ⋮ Routing in Undirected Graphs with Constant Congestion ⋮ Planar Digraphs
This page was built for publication: Graph partitioning using single commodity flows
