No label defined (Q3035310)

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 4134072
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 4134072

      Statements

      1990
      0 references
      NP-completeness
      0 references
      survey
      0 references
      greedy algorithm
      0 references
      mean chromatic number
      0 references
      graph- colouring
      0 references
      0 references
      [For the entire collection see Zbl 0693.05025.] This paper is a survey of results related to the so-called greedy algorithm, together with some suggestions about future developments, whose sections are the following: Introduction; The sequential or greedy method; Changing the order; The mean chromatic number; Discussion - the prospects for good graph-colouring. The conclusion of the paper is that the study of graph-colouring algorithms is very much a live subject, and that even the greedy method may have more to offer.
      0 references

      Identifiers