Corpus ID: 118776094

Algorithmic aspects of graph colouring heuristics

@inproceedings{Rocha2012AlgorithmicAO,
  title={Algorithmic aspects of graph colouring heuristics},
  author={Leonardo Sampaio Rocha},
  year={2012}
}
  • Leonardo Sampaio Rocha
  • Published 2012
  • Mathematics
  • Une coloration propre d’un graphe est une fonction qui attribue une couleur a chaque sommet du graphe avec la restriction que deux sommets voisins ont des couleurs distinctes. Les colorations permettent de modeliser des problemes d’ordonnancement, d’allocation de frequences ou de registres. Le probleme de trouver une coloration propre d’un graphe qui minimise le nombre de couleurs est un probleme NP-difficile tres connu. Dans cette these nous etudions le nombre de Grundy et le nombre b… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Citations

    Publications citing this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 118 REFERENCES

    Convex Sets in Lexicographic Products of Graphs

    VIEW 6 EXCERPTS
    HIGHLY INFLUENTIAL

    Algorithmic Meta-theorems for Restrictions of Treewidth

    VIEW 10 EXCERPTS
    HIGHLY INFLUENTIAL

    (Delta-k)-critical graphs

    VIEW 6 EXCERPTS
    HIGHLY INFLUENTIAL

    An algorithm for partial Grundy number on trees

    VIEW 6 EXCERPTS
    HIGHLY INFLUENTIAL

    Grundy chromatic number of the complement of bipartite graphs

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    On the hull sets and hull number of the cartesian product of graphs

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    On the b-Chromatic Number of Graphs

    VIEW 7 EXCERPTS
    HIGHLY INFLUENTIAL

    Colouring graphs when the number of colours is nearly the maximum degree

    VIEW 7 EXCERPTS
    HIGHLY INFLUENTIAL

    The b-chromatic Number of a Graph

    VIEW 8 EXCERPTS
    HIGHLY INFLUENTIAL