105 results on '"Liestman, Arthur L."'
Search Results
2. Upper bounds on the broadcast function using minimum dominating sets
3. An introduction to perpetual gossiping
4. A fault-tolerant binary tree architecture
5. Edge-disjoint spanners in tori
6. A hierarchical energy-efficient framework for data aggregation in wireless sensor networks
7. Edge-disjoint spanners in Cartesian products of graphs
8. Network communication in edge-colored graphs: gossiping
9. Factor d-domatic colorings of graphs
10. On the monotonicity of the broadcast function
11. An introduction to perpetual gossiping
12. A fault-tolerant binary tree architecture
13. Edge-disjoint spanners of complete bipartite graphs
14. The even adjacency split problem for graphs
15. More broadcast graphs
16. Edge-disjoint spanners of complete graphs and complete digraphs
17. Scheduling with slack time
18. Finding Cycles of a Given Length
19. Messy broadcasting — Decentralized broadcast schemes with limited knowledge
20. Preface
21. Nonadaptive broadcasting in trees
22. Broadcasting from multiple originators
23. A linear algorithm for finding the k‐broadcast center of a tree
24. Preface
25. A ZONAL ALGORITHM FOR CLUSTERING AN HOC NETWORKS
26. MESSY BROADCASTING IN MULTIDIMENSIONAL DIRECTED TORI
27. Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
28. Improved upper and lower bounds fork-broadcasting
29. k-Broadcasting in trees
30. Messy Broadcasting
31. Minimum Average Time Broadcast Graphs
32. A Note on the Dimensionality of Modified Knödel Graphs
33. Degree-constrained spanners for multidimensional grids
34. Degree-Constrained Network Spanners with Nonconstant Delay
35. Reliable broadcasting
36. PERPETUAL GOSSIPING
37. Additive graph spanners
38. Grid spanners
39. Minimum broadcast digraphs
40. Sparse broadcast graphs
41. Broadcasting in Bounded Degree Graphs
42. Nonadaptive broadcasting in trees.
43. ADDITIVE SPANNERS FOR HYPERCUBES
44. Maintaining weakly-connected dominating sets for clustering ad hoc networks.
45. Report on WOBCATS meeting
46. Improved upper and lower bounds for k-broadcasting.
47. A Fault-Tolerant Scheduling Problem.
48. A survey of gossiping and broadcasting in communication networks.
49. Generalizations of broadcasting and gossiping.
50. Fault-tolerant broadcast graphs.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.