scientific article; zbMATH DE number 6850403
From MaRDI portal
Publication:4607983
zbMath1403.68152MaRDI QIDQ4607983
Xilin Yu, Chao Xu, Karthekeyan Chandrasekaran
Publication date: 15 March 2018
Full work available at URL: http://dl.acm.org/citation.cfm?id=3175399
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms (68W40) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20)
Related Items (7)
Minimum Cuts and Sparsification in Hypergraphs ⋮ Faster connectivity in low-rank hypergraphs via expander decomposition ⋮ Hypergraph Cuts with General Splitting Functions ⋮ Minimum Cut and Minimum k -Cut in Hypergraphs via Branching Contractions ⋮ LP Relaxation and Tree Packing for Minimum $k$-Cut ⋮ A new contraction technique with applications to congruency-constrained cuts ⋮ New approximations and hardness results for submodular partitioning problems
This page was built for publication:
