Publication:4575873: Difference between revisions
From MaRDI portal
Publication:4575873
Created automatically from import240129110113 |
EloiFerrer (talk | contribs) m EloiFerrer moved page Doubly Balanced Connected Graph Partitioning to Doubly Balanced Connected Graph Partitioning: Duplicate |
(No difference)
|
Latest revision as of 16:06, 2 May 2024
DOI10.1137/1.9781611974782.126zbMath1410.05172arXiv1607.06509OpenAlexW2490403028MaRDI QIDQ4575873
Mihalis Yannakakis, Saleh Soltan, Gil Zussman
Publication date: 16 July 2018
Published in: ACM Transactions on Algorithms, Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1607.06509
Analysis of algorithms (68W40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)
Related Items
Approximation algorithms for the maximum bounded connected bipartition problem, Cardinality constrained connected balanced partitions of trees under different criteria, Mixed-integer programming techniques for the connected max-\(k\)-cut problem, Partitioning a graph into balanced connected classes: formulations, separation and experiments, Reconfiguration of connected graph partitions via recombination, Reconfiguration of connected graph partitions via recombination, Combinatorial approximation algorithms for the maximum bounded connected bipartition problem