Reliably Detecting Connectivity Using Local Graph Traits
Local distributed algorithms can only gather sufficient information to identify local graph traits, that is, properties that hold within the local neighborhood of each node. However, it is frequently the case that global graph properties (connectivity, diameter, girth, etc) have a large influence on...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Springer
2011
|
| Online Access: | http://hdl.handle.net/1721.1/62568 https://orcid.org/0000-0003-3045-265X |