Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 4 of 4 for “"common neighbors"”.
-
Optimal forwarding in wireless networks: opportunistic network coding
… and the ability of nodes to overhear their neighbors’ transmissions. Two of the most important such methods are opportunistic routing (OR) and wireless network coding (NC), exemplified by the ExOR and COPE protocols, respectively. This thesis presents study of jointly optimizing packet …
-
Parallel Mining and Analysis of Triangles and Communities in Big Networks
… transitivity, which states that two nodes having common neighbors tend to become neighbors themselves. In Part II, we characterize networks by quantifying the number of common neighbors and demonstrate its relationship to community structure of networks. In Part III, we design parallel algorithms …
-
Network to pology In Human Protein Interaction Data Predicts Functional Association
… proteins sharing an unusually large number of neighbors, can predict functional associations between proteins, and hence suggest their functions. One advantage of the work is that their algorithm is not sensitive to noises (false positives) in high-throughput PPI data. In this study, we …
-
Network Based Approaches for Clustering and Location Decisions
The objective of this dissertation is to study commonly occurring location and clustering problems on graphs. The dissertation is presented as a collection of results in topics including finding maximum cliques in large graphs, graph clustering in large scale graphs, determining location of …