Published June 15, 2018
| Version v1
Dataset
Open
A Benchmark Collection of Hypergraphs
Contributors
Data collectors:
- P.C. Arocena
- G. Audemard
- M. Benedikt
- J. Berg
- P. Boncz
- F. Boussemart
- R. Ciucanu
- J. K. Fichte
- F. Geerts
- B. Glavic
- G. Gottlob
- A. Gubichev
- Y. Guo
- M. Hecher
- J. Heflin
- M. Järvisalo
- A. Kemper
- G. Konstantinidis
- C. Lecoutre
- V. Leis
- N. Lodha
- D. M. Longo
- P. Papotti
- G. Mecca
- T. Neumann
- R.J. Miller
- A. Mirchev
- B. Motik
- Z. Pan
- P. Papotti
- R. Pichler
- C. Piette
- M. Samer
- D. Santoro
- S. Szeider
- E. Tsamoura
Description
This benchmark currently contains 2191 hypergraph instances that originate from CQs and CSPs instances from various sources. All hypergraphs have been generated and published by W. Fischl, G. Gottlob, D. M. Longo, and R. Pichler (2017) at http://hyperbench.dbai.tuwien.ac.at together with different hypergraph properties including various notions of width.
See Johannes K. Fichte, Markus Hecher, Neha Lodha, and Stefan Szeider: An SMT Approach to Fractional Hypertree Width, Proceedings of the 24th International Conference on Principles and Practice of Constraint Programming (CP2018) for details on the original sources of the benchmarks.
Files
grids.zip
Files
(2.9 MB)
| Name | Size | Download all |
|---|---|---|
|
md5:6f2405ef2e3f1ec83f6603016b8a972c
|
96.7 kB | Preview Download |
|
md5:44ec82daa337866cfe93035d6a1f2dce
|
2.8 MB | Preview Download |