Search Results - "Randomised distributed graph algorithm"

  • Showing 1 - 2 results of 2
Refine Results
  1. 1
    Cover Image

    On the time and the bit complexity of distributed randomised anonymous ring colouring by Métivier, Y., Robson, J.M., Saheb-Djahromi, N., Zemmari, A.

    ISSN: 0304-3975, 1879-2294
    Published: Elsevier B.V 02.09.2013
    Published in Theoretical computer science (02.09.2013)
    “…We present and analyse a very simple randomised distributed vertex colouring algorithm for ring graphs. Its time complexity is log2n+o(logn) on average and…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  2. 2
    Cover Image

    About randomised distributed graph colouring and graph partition algorithms by Métivier, Y., Robson, J.M., Saheb-Djahromi, N., Zemmari, A.

    ISSN: 0890-5401, 1090-2651
    Published: Amsterdam Elsevier Inc 2010
    Published in Information and computation (2010)
    “…We present and analyse a very simple randomised distributed vertex colouring algorithm for arbitrary graphs of size n that halts in time O ( log n ) with…”
    Get full text
    Journal Article
    Save to List
    Saved in:

Search Tools: