AN EFFICIENT DISTRIBUTED ALGORITHM FOR 3-EDGE-CONNECTIVITY (Q5483379)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: AN EFFICIENT DISTRIBUTED ALGORITHM FOR 3-EDGE-CONNECTIVITY |
scientific article; zbMATH DE number 5045316
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | AN EFFICIENT DISTRIBUTED ALGORITHM FOR 3-EDGE-CONNECTIVITY |
scientific article; zbMATH DE number 5045316 |
Statements
AN EFFICIENT DISTRIBUTED ALGORITHM FOR 3-EDGE-CONNECTIVITY (English)
0 references
14 August 2006
0 references
analysis of algorithms
0 references
graph connectivity
0 references
cut-pair
0 references
3-edge-connected component
0 references
distributed algorithms
0 references
network reliability
0 references
0 references
0 references
0.90462106
0 references
0.89998114
0 references
0.89395887
0 references
0.8870043
0 references
0.88556373
0 references
0.88275516
0 references
0.8780277
0 references
