Moral graph (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Moral graph" in English language version.

refsWebsite

Global rank English rank

2^nd place

3^rd place

69^th place

59^th place

11^th place

8^th place

arxiv.org

Verma, T. S.; Pearl, J. (1993). "Deciding morality of graphs is NP-complete". Uncertainty in Artificial Intelligence: 391–399. arXiv:1303.1501. doi:10.1016/B978-1-4832-1451-1.50052-4. ISBN 9781483214511. S2CID 14690613.

Cowell, Robert G.; Dawid, A. Philip; Lauritzen, Steffen L.; Spiegelhalter, David J. (1999). "3.2.1 Moralization". Probabilistic Networks and Expert Systems: Exact Computational Methods for Bayesian Networks. Springer-Verlag New York. pp. 31–33. doi:10.1007/0-387-22630-3_3. ISBN 0-387-98767-3.

Cowell, Robert G.; Dawid, A. Philip; Lauritzen, Steffen L.; Spiegelhalter, David J. (1999). "3.2.1 Moralization". Probabilistic Networks and Expert Systems: Exact Computational Methods for Bayesian Networks. Springer-Verlag New York. pp. 31–33. doi:10.1007/0-387-22630-3_3. ISBN 0-387-98767-3.
Verma, T. S.; Pearl, J. (1993). "Deciding morality of graphs is NP-complete". Uncertainty in Artificial Intelligence: 391–399. arXiv:1303.1501. doi:10.1016/B978-1-4832-1451-1.50052-4. ISBN 9781483214511. S2CID 14690613.

Verma, T. S.; Pearl, J. (1993). "Deciding morality of graphs is NP-complete". Uncertainty in Artificial Intelligence: 391–399. arXiv:1303.1501. doi:10.1016/B978-1-4832-1451-1.50052-4. ISBN 9781483214511. S2CID 14690613.