Conflict-free broadcasting algorithms for graph traversals and their applications (Q1195181)
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: Conflict-free broadcasting algorithms for graph traversals and their applications |
scientific article; zbMATH DE number 69193
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Conflict-free broadcasting algorithms for graph traversals and their applications |
scientific article; zbMATH DE number 69193 |
Statements
Conflict-free broadcasting algorithms for graph traversals and their applications (English)
0 references
7 October 1992
0 references
depth first search
0 references
breadth first search
0 references
spanning trees
0 references
connected components
0 references
articulation points
0 references
bridges
0 references
conflict-free broadcasting algorithms
0 references
0.766118586063385
0 references
0.7076358199119568
0 references