Pages that link to "Item:Q1398783"
From MaRDI portal
The following pages link to Distributed algorithms for finding the unique minimum distance dominating set in directed split-stars. (Q1398783):
Displaying 6 items.
- Conditional diagnosability and strong diagnosability of split-star networks under the PMC model (Q476905) (← links)
- An efficient distributed algorithm for canonical labeling on directed split-stars (Q1003736) (← links)
- Super spanning connectivity of split-star networks (Q2224849) (← links)
- Linearly many faults in Cayley graphs generated by transposition trees (Q2456457) (← links)
- A note on leader election in directed split-stars and directed alternating group graphs (Q3056381) (← links)
- Statistical mechanics of the directed 2-distance minimal dominating set problem (Q3386942) (← links)
