tri.ug {lcd} | R Documentation |
Triangulates an undirected graph to a chordal graph.
tri.ug(amat)
amat |
the adjacency matrix of undirected graph. |
The function implements the `One-step look ahead triangulation' algorithm described in Cowell, et al (1999). The criterion c(v) is chosen to be the number of edges needed to be added to the graph if vertex v is chosen to be labelled.
The adjacency matrix of the triangulated graph.
Zongming Ma and Xiangrui Meng
Cowell, R. G., Dawid, A. P., Lauritzen, S. L. and Spiegelhalter, D. J. (1999) Probabilistic Networks and Expert Systems. Springer-Verlag, New York.