Geodesic
The h-Index of a Graph and its Application to Dynamic Subgraph Statistics
Journal of Graph Algorithms and Applications, Tome 16 (2012) no. 2, pp. 543-567.

Voir la notice de l'article provenant de la source Journal of Graph Algorythms and Applications website

We describe a data structure that maintains the number of triangles in a dynamic undirected graph, subject to insertions and deletions of edges and of degree-zero vertices. More generally it can be used to maintain the number of copies of each possible three-vertex subgraph in time O(h) per update, where h is the h-index of the graph, the maximum number such that the graph contains h vertices of degree at least h. We also show how to maintain the h-index itself, and a collection of h high-degree vertices in the graph, in constant time per update. Our data structure has applications in social network analysis using the exponential random graph model (ERGM); its bound of O(h) time per edge is never worse than the Θ(√m) time per edge necessary to list all triangles in a static graph, and is strictly better for graphs obeying a power law degree distribution. In order to better understand the behavior of the h-index statistic and its implications for the performance of our algorithms, we also study the behavior of the h-index on a set of 136 real-world networks.
DOI : 10.7155/jgaa.00273
Keywords: h-index, subgraph isomorphism, dynamic graph algorithms, triangle counting, social networks 
@article{JGAA_2012_16_2_a15,
     author = {David Eppstein and Emma Spiro},
     title = {The {h-Index} of a {Graph} and its {Application} to {Dynamic} {Subgraph} {Statistics}},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {543--567},
     publisher = {mathdoc},
     volume = {16},
     number = {2},
     year = {2012},
     doi = {10.7155/jgaa.00273},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00273/}
}
TY  - JOUR
AU  - David Eppstein
AU  - Emma Spiro
TI  - The h-Index of a Graph and its Application to Dynamic Subgraph Statistics
JO  - Journal of Graph Algorithms and Applications
PY  - 2012
SP  - 543
EP  - 567
VL  - 16
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00273/
DO  - 10.7155/jgaa.00273
LA  - en
ID  - JGAA_2012_16_2_a15
ER  - 
%0 Journal Article
%A David Eppstein
%A Emma Spiro
%T The h-Index of a Graph and its Application to Dynamic Subgraph Statistics
%J Journal of Graph Algorithms and Applications
%D 2012
%P 543-567
%V 16
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00273/
%R 10.7155/jgaa.00273
%G en
%F JGAA_2012_16_2_a15
David Eppstein; Emma Spiro. The h-Index of a Graph and its Application to Dynamic Subgraph Statistics. Journal of Graph Algorithms and Applications, Tome 16 (2012) no. 2, pp. 543-567. doi : 10.7155/jgaa.00273. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00273/

Cité par Sources :