A comparison of two approaches for polynomial time algorithms computing basic graph parameters

Frank Gurski

In this paper we compare and illustrate the algorithmic use of graphs of bounded tree-width and graphs of bounded clique-width. For this purpose we give polynomial time algorithms…