XNLP-completeness for parameterized problems on graphs with a linear structure (Q6969004)

From MaRDI portal
!
WARNING

This is the item page for this Wikibase entity, intended for internal use and editing purposes.

scientific article; zbMATH DE number 8055114
Language Label Description Also known as
default for all languages
No label defined
    English
    XNLP-completeness for parameterized problems on graphs with a linear structure
    scientific article; zbMATH DE number 8055114

      Statements

      XNLP-completeness for parameterized problems on graphs with a linear structure (English)
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      23 June 2025
      0 references
      parameterized complexity
      0 references
      XNLP
      0 references
      linear clique-width
      0 references
      W-hierarchy
      0 references
      pathwidth
      0 references
      linear mim-width
      0 references
      bandwidth
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references