The h-Index of a Graph and its Application to Dynamic Subgraph Statistics

DOI10.7155/jgaa.00273zbMath1254.68098OpenAlexW2000979164MaRDI QIDQ3143753

Emma S. Spiro, David Eppstein

Publication date: 4 December 2012

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00273

zbMATH Keywords

social network analysisexponential random graph model

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Vertex degrees (05C07)

Related Items (14)

Assessing the Computational Complexity of Multi-layer Subgraph Detection ⋮ The Micro-world of Cographs ⋮ The micro-world of cographs ⋮ Win-win kernelization for degree sequence completion problems ⋮ Quasipolynomiality of the Smallest Missing Induced Subgraph ⋮ Computing dense and sparse subgraphs of weakly closed graphs ⋮ Positional Dominance: Concepts and Algorithms ⋮ Multivariate algorithmics for finding cohesive subnetworks ⋮ Graph parameters, implicit representations and factorial properties ⋮ Parameterized aspects of triangle enumeration ⋮ Hardness and tractability of the \(\gamma\)\textsf{-Complete Subgraph} problem ⋮ On structural parameterizations for the 2-club problem ⋮ Hereditary classes of graphs: a parametric approach ⋮ An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems

This page was built for publication: The h-Index of a Graph and its Application to Dynamic Subgraph Statistics