On partitioning of hypergraphs
From MaRDI portal
Publication:879389
DOI10.1016/j.disc.2006.09.022zbMath1129.05032OpenAlexW2120144169MaRDI QIDQ879389
Roberto Battiti, Sergei L. Bezrukov
Publication date: 11 May 2007
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2006.09.022
Hypergraphs (05C65) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items
Reflect-push methods. Part I: Two dimensional techniques, Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new approach to Macaulay posets
- On an equivalence in discrete extremal problems
- The edge-isoperimetric problem for discrete tori
- The spider poset is Macaulay
- Recent directions in netlist partitioning: a survey
- Optimal shadows and ideals in submatrix orders
