A Universal Low Complexity Compression Algorithm for Sparse Marked Graphs

Payam Delgosha, Venkat Anantharam. A Universal Low Complexity Compression Algorithm for Sparse Marked Graphs. IEEE J. Sel. Areas Inf. Theory, 3(4):746-758, December 2022. [doi]

@article{DelgoshaA22-0,
  title = {A Universal Low Complexity Compression Algorithm for Sparse Marked Graphs},
  author = {Payam Delgosha and Venkat Anantharam},
  year = {2022},
  month = {December},
  doi = {10.1109/JSAIT.2023.3238325},
  url = {https://doi.org/10.1109/JSAIT.2023.3238325},
  researchr = {https://researchr.org/publication/DelgoshaA22-0},
  cites = {0},
  citedby = {0},
  journal = {IEEE J. Sel. Areas Inf. Theory},
  volume = {3},
  number = {4},
  pages = {746-758},
}