Login / Signup

Analysis of a memory-efficient self-stabilizing BFS spanning tree construction.

Ajoy K. DattaStéphane DevismesColette JohnenLawrence L. Larmore
Published in: Theor. Comput. Sci. (2023)
Keyphrases
  • depth first search
  • iterative deepening
  • spanning tree
  • minimum spanning tree
  • memory efficient
  • minimum cost
  • undirected graph
  • social network analysis
  • multimedia
  • optimal solution
  • special case
  • graphical models