Layout of Bayesian Networks

Marriott, K., Moulder, P., Hope, L. and Twardy, C.

    Bayesian networks are weighted directed acyclic graphs (DAGs). Layout of DAGs has been studied for many years, with variants of the horizontal layering algorithm of Sugiyama et al. (Sugiyama, Tagawa & Toda 1981) the preferred approach for medium size graphs. Following Gansner et al. (Gansner, Koutsofios, North & Vo 1993) we extend the classic horizontal layering algorithm with an additional vertex coordinate assignment phase which is designed to remove overlap between vertices with non-zero width and height. This is required because vertices in the Bayesian network are typically large and may vary greatly in height and width so a major component of good layout is to place vertices closely together without overlap. Our main contribution is to describe and evaluate a variety of novel techniques for vertex coordinate assignment.
Cite as: Marriott, K., Moulder, P., Hope, L. and Twardy, C. (2005). Layout of Bayesian Networks. In Proc. Twenty-Eighth Australasian Computer Science Conference (ACSC2005), Newcastle, Australia. CRPIT, 38. Estivill-Castro, V., Ed. ACS. 97-106.
pdf (from pdf (local if available) BibTeX EndNote GS