How to solve NP-hard graph problems on clique-width bounded graphs in polynomial time (Q4448752)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 2044928
Language Label Description Also known as
default for all languages
No label defined
    English
    How to solve NP-hard graph problems on clique-width bounded graphs in polynomial time
    scientific article; zbMATH DE number 2044928

      Statements

      0 references
      0 references
      0 references
      18 February 2004
      0 references
      How to solve NP-hard graph problems on clique-width bounded graphs in polynomial time (English)
      0 references

      Identifiers