Learning directed acyclic graphs based on sparsest permutations

DOI10.1002/sta4.183arXiv1307.0366WikidataQ129978110 ScholiaQ129978110MaRDI QIDQ6243035

Garvesh Raskutti, Caroline Uhler

Publication date: 1 July 2013

Mathematics Subject Classification ID

Statistics (62-XX)

This page was built for publication: Learning directed acyclic graphs based on sparsest permutations