GraphAlgo-mpd: Maximal prime subgraph decomposition
In gRbase: A package for graphical modelling in R

Description Usage Arguments Details Value Author(s) References See Also Examples

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

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

`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.

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

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

Clive Bowsher C.Bowsher@statslab.cam.ac.uk with modifications by S<f8>ren H<f8>jsgaard, sorenh@math.aau.dk

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

mcs, mcsMAT, minimalTriang, minimalTriangMAT, rip, ripMAT, triangulate, triangulateMAT

## Maximal prime subgraph decomposition - a graphNEL object
g1 <- ug(~a:b+b:c+c:d+d:e+e:f+a:f+b:e)
if (interactive()) plot(g1)
x <- mpd(g1)

## Maximal prime subgraph decomposition - an adjacency matrix
g1m <- ug(~a:b+b:c+c:d+d:e+e:f+a:f+b:e, result="matrix")
if (interactive()) plot(as(g1m, "graphNEL"))
x <- mpdMAT(g1m)