An efficient distributed algorithm for centering a spanning tree of a biconnected graph (Q671408)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 983277
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient distributed algorithm for centering a spanning tree of a biconnected graph |
scientific article; zbMATH DE number 983277 |
Statements
An efficient distributed algorithm for centering a spanning tree of a biconnected graph (English)
0 references
27 February 1997
0 references
Algorithms
0 references
Distributed graph algorithms
0 references
Biconnected graphs
0 references
st-numbering
0 references
Center
0 references
Spanning tree
0 references
0.9395725
0 references
0.92366534
0 references
0.9175633
0 references
0.9062487
0 references
0.88631505
0 references
0 references
0.8843046
0 references
