The difficulty of being moral

DOI10.1016/j.tcs.2021.06.024OpenAlexW3177051061MaRDI QIDQ1981772

Yang Li, Lloyd Allison, Kevin B. Korb

Publication date: 6 September 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2021.06.024

zbMATH Keywords

computational complexityMarkov blanketmoral graphweakly recursive simplicial

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Phylogeny numbers of generalized Hamming graphs

Cites Work

• The max-min hill-climbing Bayesian network structure learning algorithm
• Towards scalable and data efficient learning of Markov boundaries
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The difficulty of being moral