Triangulating Clustered Graphs
M. Jünger, S. Leipert, M. Percan, Technical Report No. 2002.435 (2002). Abstract A clustered graph C=(G,T) consists of an undirected graph G and a rooted tree T in which the leaves of T correspond to the vertices of G=(V,E) . Each vertex mu in T corresponds to a subset of the vertices of the graph […]