Table 1 Time complexity of the constraint-based algorithms.
From: Triplet offline causal discovery based on optimal Markov blanket and its application
Algorithms | Time complexity | Algorithms | Time complexity |
|---|---|---|---|
IAMB | \(O\left( |R^{2}| \right)\) | MMMB | \(O\left( 2^{|PC|} |R||PC|\right)\) |
HITON-MB | \(O\left( 2^{|PC|} |R||PC|\right)\) | PCMB | \(O\left( 2^{|PC|}|R||PC^{2}| \right)\) |
IPCMB | \(O\left( 2^{|R|}|R||PC| \right)\) | STMB | \(O\left( 2^{|R|}|R| \right)\) |
BAMB | \(O\left( 2^{|PC|}|R| \right)\) | EEMB | \(O\left( 2^{|PC|}|R| \right)\) |
EMB | \(O\left( 2^{|PC|}|R| \right)\) | FSMB | \(O\left( 2^{|PC|}|R| \right)\) |
T-OCD\(_{MB}\) | \(O\left( 2^{|PC|}|R| \right)\) | – | – |
