Search

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

Search Constraints

Start Over You searched for: Descriptor "Common neighbor" Remove constraint Descriptor: "Common neighbor" Publisher springer berlin heidelberg Remove constraint Publisher: springer berlin heidelberg
73 results on '"Common neighbor"'

Search Results

2. On the Usability of Lombardi Graph Drawings

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

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

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

6. Link Prediction Approaches for Disease Networks

7. Multilevel Drawings of Clustered Graphs

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

9. Protecting Sensitive Relationships against Inference Attacks in Social Networks

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

11. Drawing Cubic Graphs with the Four Basic Slopes

12. Independence

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

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

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

18. Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization

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

20. Role Discovery for Graph Clustering

21. Dichotomy for Coloring of Dart Graphs

23. A Planar Linear Arboricity Conjecture

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

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

27. On Link Privacy in Randomizing Social Networks

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

29. Constraint Bipartite Vertex Cover Simpler Exact Algorithms and Implementations

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

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

32. Logic and Random Structures

34. Exact Algorithms for L(2,1)-Labeling of Graphs

35. The Cluster Editing Problem: Implementations and Experiments

36. XML Clustering Based on Common Neighbor

37. Tradeoffs in Depth-Two Superconcentrators

39. Clustering XML Documents by Structure Based on Common Neighbor

40. Recognizing HHD-free and Welsh-Powell Opposition Graphs

41. Communities Detection in Large Networks

44. New Lower and Upper Bounds for Graph Treewidth

Catalog

Books, media, physical & digital resources