Approximating clustering coefficient and transitivity.
Schank, Thomas; Wagner, Dorothea
Journal of Graph Algorithms and Applications (2005)
- Volume: 9, Issue: 2, page 265-275
- ISSN: 1526-1719
Access Full Article
top
How to cite
topSchank, Thomas, and Wagner, Dorothea. "Approximating clustering coefficient and transitivity.." Journal of Graph Algorithms and Applications 9.2 (2005): 265-275. <http://eudml.org/doc/52329>.
@article{Schank2005,
author = {Schank, Thomas, Wagner, Dorothea},
journal = {Journal of Graph Algorithms and Applications},
keywords = {fast approximation algorithm; graph generator algorithm},
language = {eng},
number = {2},
pages = {265-275},
publisher = {Brown University, Providence, RI; University of Texas, Dallas},
title = {Approximating clustering coefficient and transitivity.},
url = {http://eudml.org/doc/52329},
volume = {9},
year = {2005},
}
TY - JOUR
AU - Schank, Thomas
AU - Wagner, Dorothea
TI - Approximating clustering coefficient and transitivity.
JO - Journal of Graph Algorithms and Applications
PY - 2005
PB - Brown University, Providence, RI; University of Texas, Dallas
VL - 9
IS - 2
SP - 265
EP - 275
LA - eng
KW - fast approximation algorithm; graph generator algorithm
UR - http://eudml.org/doc/52329
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.