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

From MaRDI portal
Changed label, description and/or aliases in en, and other parts
Merged Item from Q5327469
 
aliases / en / 0aliases / en / 0
 
Sublinear-Time Maintenance of Breadth-First Spanning Tree in Partially Dynamic Networks
description / endescription / en
 
scientific article; zbMATH DE number 6196365
Property / title
 
Sublinear-Time Maintenance of Breadth-First Spanning Tree in Partially Dynamic Networks (English)
Property / title: Sublinear-Time Maintenance of Breadth-First Spanning Tree in Partially Dynamic Networks (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1335.68183 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-642-39212-2_53 / rank
 
Normal rank
Property / published in
 
Property / published in: Automata, Languages, and Programming / rank
 
Normal rank
Property / publication date
 
7 August 2013
Timestamp+2013-08-07T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 7 August 2013 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6196365 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2779584863 / rank
 
Normal rank

Latest revision as of 10:18, 6 May 2024

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