gRbase (version 1.3.9)

mpd: Maximal prime subgraph decomposition

Description

Finding a junction tree representation of the MPD (maximal prime subgraph decomposition) of an undirected graph

Usage

mpd(uG, TuG = minimalTriang(uG, details = 0), details = 0)
mpdMAT(uGmat, TuGmat = minimalTriangMAT(uGmat, details = 0), details = 0)

Arguments

uG

An undirected graph; a graphNEL object

TuG

Any minimal triangulation of uG; a graphNEL object

uGmat

An undirected graph; a symmetric adjacency matrix

TuGmat

Any minimal triangulation of uG; a symmetric adjacency matrix

details

The amount of details to be printed.

Value

• A list with components "nodes", "cliques", "separators", "parents", "children", "nLevels". The component "cliques" defines the subgraphs.

Details

The maximal prime subgraph decomposition of a graph is the smallest subgraphs into which the graph can be decomposed.

References

Kristian G. Olesen and Anders L. Madsen (2002): Maximal Prime Subgraph Decomposition of Bayesian Networks. IEEE TRANSACTIONS ON SYSTEMS, MAN AND CYBERNETICS, PART B: CYBERNETICS, VOL. 32, NO. 1, FEBRUARY 2002

See Also

minimalTriang,rip, triangulate

Examples

## A graphNEL object
g1 <- ug(~a:b+b:c+c:d+d:e+e:f+a:f+b:e)
x <- mpd(g1)


## An adjacency matrix
g1m <- ugMAT(~a:b+b:c+c:d+d:e+e:f+a:f+b:e)
x <- mpdMAT(g1m)