𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An Algorithmic Version of the Hypergraph Regularity Method

✍ Scribed by Haxell, P. E.; Nagle, B.; Rödl, V.

Book ID
118180738
Publisher
Society for Industrial and Applied Mathematics
Year
2008
Tongue
English
Weight
484 KB
Volume
37
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithmic version of the blow-up le
An algorithmic version of the blow-up lemma
✍ János Komlós; Gabor N. Sarkozy; Endre Szemerédi 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 210 KB 👁 1 views

Recently we developed a new method in graph theory based on the regularity lemma. The method is applied to find certain spanning subgraphs in dense graphs. The other main general tool of the method, besides the regularity lemma, is the so-called blow-up Ž w Ž .x lemma Komlos, Sarkozy, and Szemeredi

An Algorithm for the Modular Decompositi
An Algorithm for the Modular Decomposition of Hypergraphs
✍ Paola Bonizzoni; Gianluca Della Vedova 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 147 KB

We propose an O n algorithm to build the modular decomposition tree of hypergraphs of dimension three and show how this algorithm can be generalized to time the decomposition of hypergraphs of any fixed dimension k.