Compressing Hypergraphs using Suffix Sorting

E. Adler, S. Böttcher, R. Hartel, in: Data Compression Conference, DCC 2026, Snowbird, UT, USA, March 24-27, 2026, IEEE, 2026, pp. 113–122.

Download
No fulltext has been uploaded.
Conference Paper
Author
Adler, Enno; Böttcher, Stefan; Hartel, Rita
Publishing Year
Proceedings Title
Data Compression Conference, DCC 2026, Snowbird, UT, USA, March 24-27, 2026
Page
113–122
LibreCat-ID

Cite this

Adler E, Böttcher S, Hartel R. Compressing Hypergraphs using Suffix Sorting. In: Data Compression Conference, DCC 2026, Snowbird, UT, USA, March 24-27, 2026. IEEE; 2026:113–122. doi:10.1109/DCC66757.2026.00019
Adler, E., Böttcher, S., & Hartel, R. (2026). Compressing Hypergraphs using Suffix Sorting. Data Compression Conference, DCC 2026, Snowbird, UT, USA, March 24-27, 2026, 113–122. https://doi.org/10.1109/DCC66757.2026.00019
@inproceedings{Adler_Böttcher_Hartel_2026, title={Compressing Hypergraphs using Suffix Sorting}, DOI={10.1109/DCC66757.2026.00019}, booktitle={Data Compression Conference, DCC 2026, Snowbird, UT, USA, March 24-27, 2026}, publisher={IEEE}, author={Adler, Enno and Böttcher, Stefan and Hartel, Rita}, year={2026}, pages={113–122} }
Adler, Enno, Stefan Böttcher, and Rita Hartel. “Compressing Hypergraphs Using Suffix Sorting.” In Data Compression Conference, DCC 2026, Snowbird, UT, USA, March 24-27, 2026, 113–122. IEEE, 2026. https://doi.org/10.1109/DCC66757.2026.00019.
E. Adler, S. Böttcher, and R. Hartel, “Compressing Hypergraphs using Suffix Sorting,” in Data Compression Conference, DCC 2026, Snowbird, UT, USA, March 24-27, 2026, 2026, pp. 113–122, doi: 10.1109/DCC66757.2026.00019.
Adler, Enno, et al. “Compressing Hypergraphs Using Suffix Sorting.” Data Compression Conference, DCC 2026, Snowbird, UT, USA, March 24-27, 2026, IEEE, 2026, pp. 113–122, doi:10.1109/DCC66757.2026.00019.

Export

Marked Publications

Open Data LibreCat

Search this title in

Google Scholar