tri.ug {lcd}R Documentation

Triangulation of an undirected graph

Description

Triangulates an undirected graph to a chordal graph.

Usage

tri.ug(amat) 

Arguments

amat the adjacency matrix of undirected graph.

Details

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.

Value

The adjacency matrix of the triangulated graph.

Author(s)

Zongming Ma and Xiangrui Meng

References

Cowell, R. G., Dawid, A. P., Lauritzen, S. L. and Spiegelhalter, D. J. (1999) Probabilistic Networks and Expert Systems. Springer-Verlag, New York.


[Package lcd version 0.7-2 Index]