Preprocessing complexity for some graph problems parameterized by structural parameters (Q6885243)

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 8135835
Language Label Description Also known as
default for all languages
No label defined
    English
    Preprocessing complexity for some graph problems parameterized by structural parameters
    scientific article; zbMATH DE number 8135835

      Statements

      Preprocessing complexity for some graph problems parameterized by structural parameters (English)
      0 references
      0 references
      0 references
      11 December 2025
      0 references
      polynomial kernel
      0 references
      polynomial Turing kernel
      0 references
      MK/WK-hard
      0 references
      structural parameter
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references