The shortest path reconfiguration problem based on relaxation of reconfiguration rules (Q6575398)

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 7883872
Language Label Description Also known as
default for all languages
No label defined
    English
    The shortest path reconfiguration problem based on relaxation of reconfiguration rules
    scientific article; zbMATH DE number 7883872

      Statements

      The shortest path reconfiguration problem based on relaxation of reconfiguration rules (English)
      0 references
      0 references
      0 references
      0 references
      0 references
      19 July 2024
      0 references
      reconfiguration problem
      0 references
      graph algorithm
      0 references
      parameterized complexity
      0 references
      shortest path
      0 references

      Identifiers