On the Radius of Nonsplit Graphs and Information Dissemination in Dynamic Networks

@article{Fgger2019OnTR,
  title={On the Radius of Nonsplit Graphs and Information Dissemination in Dynamic Networks},
  author={Matthias F{\"u}gger and Thomas Nowak and Kyrill Winkler},
  journal={ArXiv},
  year={2019},
  volume={abs/1901.06824}
}
  • Matthias Függer, Thomas Nowak, Kyrill Winkler
  • Published in ArXiv 2019
  • Mathematics, Computer Science
  • A nonsplit graph is a directed graph where each pair of nodes has a common incoming neighbor. We show that the radius of such graphs is in $O(\log \log n)$, where $n$ is the number of nodes. We then generalize the result to products of nonsplit graphs. The analysis of nonsplit graph products has direct implications in the context of distributed systems, where processes operate in rounds and communicate via message passing in each round: communication graphs in several distributed systems… CONTINUE READING

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

    References

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

    Distributed computation in dynamic networks

    VIEW 3 EXCERPTS
    HIGHLY INFLUENTIAL

    Consensus in rooted dynamic networks with short-lived stability

    VIEW 1 EXCERPT

    A New Robust Interference Reduction Scheme for Low Complexity Direct-Sequence Spread-Spectrum Receivers: Performance

    VIEW 1 EXCERPT

    Unfairness and capture behaviour in 802.11 adhoc networks

    VIEW 1 EXCERPT