Reducing conflict resolution time for solving graph problems in broadcast communications (Q1183491)
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: Reducing conflict resolution time for solving graph problems in broadcast communications |
scientific article; zbMATH DE number 33330
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reducing conflict resolution time for solving graph problems in broadcast communications |
scientific article; zbMATH DE number 33330 |
Statements
Reducing conflict resolution time for solving graph problems in broadcast communications (English)
0 references
28 June 1992
0 references
parallel algorithms
0 references
topological ordering
0 references
breadth-first search
0 references
connected component
0 references
broadcast communication model
0 references
time complexity
0 references
graph
0 references
