An algorithm for reading dependencies from the minimal undirected independence map of a graphoid that satisfies weak transitivity

Jose M. Peña, Roland Nilsson, Johan Björkegren, Jesper Tegnér

Research output: Contribution to journalArticlepeer-review

8 Scopus citations

Fingerprint

Dive into the research topics of 'An algorithm for reading dependencies from the minimal undirected independence map of a graphoid that satisfies weak transitivity'. Together they form a unique fingerprint.

Mathematics

Keyphrases