TY - GEN A1 - Bodlaender, Hans L. A1 - Koster, Arie M.C.A. A1 - Eijkhof, Frank van den A1 - Gaag, Linda C. van der T1 - Pre-processing for Triangulation of Probabilistic Networks N2 - The currently most efficient algorithm for inference with a probabilistic network builds upon a triangulation of a network's graph. In this paper, we show that pre-processing can help in finding good triangulations for probabilistic networks, that is, triangulations with a minimal maximum clique size. We provide a set of rules for stepwise reducing a graph, without losing optimality. This reduction allows us to solve the triangulation problem on a smaller graph. From the smaller graph's triangulation, a triangulation of the original graph is obtained by reversing the reduction steps. Our experimental results show that the graphs of some well-known real-life probabilistic networks can be triangulated optimally just by preprocessing; for other networks, huge reductions in their graph's size are obtained. T3 - ZIB-Report - 01-39 KW - triangulation KW - treewidth KW - probabilistic networks KW - pre-processing Y1 - 2001 UR - https://opus4.kobv.de/opus4-zib/frontdoor/index/index/docId/665 UR - https://nbn-resolving.org/urn:nbn:de:0297-zib-6655 ER -