Sparsest cuts and concurrent flows in product graphs.
From MaRDI portal
Publication:1427176
DOI10.1016/S0166-218X(03)00439-6zbMath1036.90023MaRDI QIDQ1427176
Publication date: 14 March 2004
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
68R10: Graph theory (including graph drawing) in computer science
90B10: Deterministic network models in operations research
05C99: Graph theory
Related Items
Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs, The complexity of finding uniform sparsest cuts in various graph classes, Euclidean prize-collecting Steiner forest, The Complexity Status of Problems Related to Sparsest Cuts, Linear time algorithms for finding sparsest cuts in various graph classes
Cites Work