Search

Your search keyword '"Common neighbor"' showing total 204 results

Search Constraints

Start Over You searched for: Descriptor "Common neighbor" Remove constraint Descriptor: "Common neighbor"
204 results on '"Common neighbor"'

Search Results

1. 结合邻居影响和资源分配的链路预测算法.

2. The Node-Similarity Distribution of Complex Networks and Its Applications in Link Prediction.

3. Link prediction method based on the similarity of high path

4. A DBN Approach to Predict the Link in Opportunistic Networks

5. Link prediction methods based on generalized common neighbor in directed network

6. Link prediction methods based on generalized common neighbor in directed network

7. Link prediction method based on the similarity of high path.

8. Link Prediction in Temporal Heterogeneous Networks

9. Random Graphs as Null Models

10. Visualization and Analysis Strategies for Atomistic Simulations

11. A Biclique Approach to Reference Anchored Gene Blocks and Its Applications to Pathogenicity Islands

12. Community-Based Link Prediction in Social Networks

13. The k-Leaf Spanning Tree Problem Admits a Klam Value of 39

14. A Holistic Approach for Link Prediction in Multiplex Networks

16. Link prediction based on the tie connection strength of common neighbor.

18. On the Usability of Lombardi Graph Drawings

19. The Multi-parameterized Cluster Editing Problem

20. A Nash Equilibrium Based Algorithm for Mining Hidden Links in Social Networks

22. Randomly Coloring Regular Bipartite Graphs and Graphs with Bounded Common Neighbors

23. An Improved Kernel for the Undirected Planar Feedback Vertex Set Problem

24. A Tight Upper Bound on the Number of Variables for Average-Case k-Clique on Ordered Graphs

25. Link Prediction Approaches for Disease Networks

26. Multilevel Drawings of Clustered Graphs

27. Linear Time Algorithm for Computing a Small Biclique in Graphs without Long Induced Paths

28. Protecting Sensitive Relationships against Inference Attacks in Social Networks

29. SINBAD: Towards Structure-Independent Querying of Common Neighbors in XML Databases

30. Drawing Cubic Graphs with the Four Basic Slopes

31. Independence

34. On the Independence Number of Graphs with Maximum Degree 3

35. Dense Locally Testable Codes Cannot Have Constant Rate and Distance

36. On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity

37. Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization

38. Fast Exact Algorithm for L(2,1)-Labeling of Graphs

39. Role Discovery for Graph Clustering

40. Dichotomy for Coloring of Dart Graphs

42. A Planar Linear Arboricity Conjecture

44. Common Neighborhood Sub-graph Density as a Similarity Measure for Community Detection

45. A Geometric Approach to Paradoxes of Majority Voting in Abstract Aggregation Theory

46. On Link Privacy in Randomizing Social Networks

47. Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract)

48. Constraint Bipartite Vertex Cover Simpler Exact Algorithms and Implementations

49. An Improved Fixed-Parameter Algorithm for Minimum-Flip Consensus Trees

50. Minimizing the Area for Planar Straight-Line Grid Drawings

Catalog

Books, media, physical & digital resources