A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is
Clique-width of graphs is a major new concept with respect to efficiency of graph algorithms; it is known that every algorithmic problem expressible in a certain kind of Monadic Second Order Logic called LinEMSOL(τ1,L) by Courcelle, Makowsky and Rotics, is solvable in linear time on any graph class with bounded clique-width for which a k-expression for the input graph can be constructed in linear time. The concept of clique-width extends the one of treewidth since bounded treewidth impliesdoi:10.1007/s00224-004-1154-6 fatcat:a3yucbewjvgejikclpwtxnym3y