A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Many hard problems on graphs become solvable in polynomial-time if the inputs are restricted to graphs of bounded clique-or NLC-width. Cliquewidth and NLC-width differ at most by a factor of two. ... Cliquewidth and NLC-width are two closely related parameters that measure the complexity of graphs. ... Theorem 1 . 1 The relative NLC-width of a graph on n vertices can be computed in time O(n 3 ) while the problem Relative Cliquewidth is NP-complete. ...doi:10.1016/j.dam.2009.06.024 fatcat:7oldbulk6bfjbeqpq7ddtqlcf4