Pages that link to "Item:Q2760286"
From MaRDI portal
The following pages link to Efficient broadcasting in an arrangement graph using multiple spanning trees (Q2760286):
Displaying 7 items.
- An efficient algorithm for multiple simultaneous broadcasts in the hypercube (Q685525) (← links)
- Efficient group coordination in multicast trees (Q1395712) (← links)
- Embedding \(k\)(\(n-k\)) edge-disjoint spanning trees in arrangement graphs. (Q1426221) (← links)
- An Efficient Vertex Addition Method for Broadcast Networks (Q3400884) (← links)
- Fault-Tolerant Broadcasting on the Arrangement Graph (Q4226636) (← links)
- A Broadcasting Algorithm with Time and Message Optimum on Arrangement Graphs (Q4397213) (← links)
- (Q4604110) (← links)