Pages that link to "Item:Q3766873"
From MaRDI portal
The following pages link to A new distributed algorithm to find breadth first search trees (Q3766873):
Displaying 7 items.
- Distributed computation of coverage in sensor networks by homological methods (Q714652) (← links)
- A distributed shortest path algorithm for a planar network (Q918205) (← links)
- Graph theoretical issues in computer networks (Q1319540) (← links)
- Piecemeal graph exploration by a mobile robot. (Q1854296) (← links)
- Distributed balanced color assignment on arbitrary networks (Q2290638) (← links)
- Efficient distributed algorithms for single-source shortest paths and related problems on plane networks (Q4000864) (← links)
- An efficient distributed algorithm for finding all hinge vertices in networks (Q5466762) (← links)