Efficient methods to compute optimal tree approximations of directed information graphs

Christopher J. Quinn, Negar Kiyavash, Todd P. Coleman

Research output: Contribution to journal › Article › peer-review

Fingerprint

Dive into the research topics of 'Efficient methods to compute optimal tree approximations of directed information graphs'. Together they form a unique fingerprint.

Keyphrases

Computer Science

Mathematics