Graph algorithms

Thursday, 9 October 2003

Lecture

The lecture describes the relation between chordal and decomposable graphs, perfect numberings, junction trees and algorithms for constructing these

The closest  text can be found in Chapter 4 of [PNES], pp. 49-58.

Overheads for screen-viewing and printing.

 

    Previous lecture

    Next lecture

    Course plan


    Steffen L. Lauritzen < steffen@math.auc.dk>  

    Last modified: 28. oktober 2003