Skip to main content
Conference Proceedings

An Algorithm to Find a Perfect Map for Graphoid Structures

Communications in Computer and Information Science (2010) 80 PART 1 1-10
DOI: 10.1007/978-3-642-14055-6_1
1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We provide a necessary and sufficient condition for the existence of a perfect map representing an independence model and we give an algorithm for checking this condition and drawing a perfect map, when it exists. © Springer-Verlag Berlin Heidelberg 2010.

Author supplied keywords

Cite

CITATION STYLE

APA

Baioletti, M., Busanello, G., & Vantaggi, B. (2010). An Algorithm to Find a Perfect Map for Graphoid Structures. In Communications in Computer and Information Science (Vol. 80 PART 1, pp. 1–10). https://doi.org/10.1007/978-3-642-14055-6_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free