Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic Networks (Q4554941)

From MaRDI portal
Revision as of 10:18, 6 May 2024 by EloiFerrer (talk | contribs) (‎Merged Item from Q5327469)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6196365
  • Sublinear-Time Maintenance of Breadth-First Spanning Tree in Partially Dynamic Networks
Language Label Description Also known as
English
Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic Networks
scientific article; zbMATH DE number 6196365
  • Sublinear-Time Maintenance of Breadth-First Spanning Tree in Partially Dynamic Networks

Statements

Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic Networks (English)
0 references
Sublinear-Time Maintenance of Breadth-First Spanning Tree in Partially Dynamic Networks (English)
0 references
0 references
0 references
0 references
0 references
0 references
12 November 2018
0 references
7 August 2013
0 references
0 references
0 references
0 references
0 references
0 references
0 references
distributed algorithms
0 references
dynamic algorithms
0 references
0 references
0 references
0 references