Finding shortest paths between graph colourings (Q309791)

From MaRDI portal
Revision as of 12:49, 12 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Finding shortest paths between graph colourings
scientific article

    Statements

    title
    Finding shortest paths between graph colourings (English)
    0 references
    author
    Matthew Johnson
    0 references
    Dieter Kratsch
    0 references
    Stefan Kratsch
    0 references
    Viresh Patel
    0 references
    Daniël Paulusma
    0 references
    published in
    Algorithmica
    0 references
    publication date
    7 September 2016
    0 references
    zbMATH Keywords
    graph colouring
    0 references
    graph algorithms
    0 references
    reconfigurations
    0 references
    reconfiguration graphs
    0 references
    fixed parameter tractability
    0 references
    cites work
    Q2957511
    0 references
    Q4083461
    0 references
    Q5710169
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q25
    0 references
    05C15
    0 references
    05C85
    0 references
    zbMATH DE Number
    6624620
    0 references
    OpenAlex ID
    W1573626259
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q309791&oldid=36272167"
    Powered by MediaWiki