Approximate Hypergraph Partitioning and Applications

DOI10.1137/080717584zbMath1271.68113OpenAlexW2128139967WikidataQ105584141 ScholiaQ105584141MaRDI QIDQ5390591

Eldar Fischer, Asaf Shapira, Arie Matsliah

Publication date: 4 April 2011

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/080717584

zbMATH Keywords

partitioninghypergraphregularity lemmaproperty testing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (8)

Rainbow connections of graphs: a survey ⋮ On Regularity Lemmas and their Algorithmic Applications ⋮ Testable and untestable classes of first-order formulae ⋮ Introduction to Testing Graph Properties ⋮ Hardness and algorithms for rainbow connection ⋮ Introduction to Testing Graph Properties ⋮ Relational Properties Expressible with One Universal Quantifier Are Testable ⋮ Computing Eigenvalues of Large Scale Sparse Tensors Arising from a Hypergraph

This page was built for publication: Approximate Hypergraph Partitioning and Applications