Computation of Graphlet Orbits for Nodes and Edges in Sparse Graphs
Graphlet analysis is a useful tool for describing local network topology around individual nodes or edges. A node or an edge can be described by a vector containing the counts of different kinds of graphlets (small induced subgraphs) in which it appears, or the "roles" (orbits) it has within these g...
محفوظ في:
| المؤلفون الرئيسيون: | , |
|---|---|
| التنسيق: | Artigo |
| اللغة: | Inglês |
| منشور في: |
Foundation for Open Access Statistics
2016-07-01
|
| سلاسل: | Journal of Statistical Software |
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://www.jstatsoft.org/index.php/jss/article/view/2781 |
| الوسوم: |
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
