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

DOI10.7155/JGAA.00273MaRDI QIDQ3143753zbMATH OpenOpenAlexFDO

Authors David Eppstein, Emma S. Spiro

Publication date 4 December 2012

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

social network analysisexponential random graph model

Mathematics Subject Classification ID

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

Recommendations

• The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics
• Extended dynamic subgraph statistics using h-index parameterized data structures
• Extended dynamic subgraph statistics using \(h\)-index parameterized data structures
• A note on the \(H\) index in random networks
• The \(H_0\) function, a new index for detecting structural/topological complexity information in undirected graphs
• Subgraph statistics in subcritical graph classes
• On the Hosoya index of graphs
• A dynamic data structure for counting subgraphs in sparse graphs
• THE HARARY INDEX OF A GRAPH UNDER PERTURBATION

Cited in

(17)

• Multivariate algorithmics for finding cohesive subnetworks
• The micro-world of cographs
• Assessing the computational complexity of multi-layer subgraph detection
• Parameterized local search for vertex cover: when only the search radius is crucial
• Hereditary classes of graphs: a parametric approach
• Positional dominance: concepts and algorithms
• Win-win kernelization for degree sequence completion problems
• Extended dynamic subgraph statistics using \(h\)-index parameterized data structures
• Quasipolynomiality of the Smallest Missing Induced Subgraph
• Extended dynamic subgraph statistics using h-index parameterized data structures
• Hardness and tractability of the \(\gamma\)-complete subgraph problem
• Computing dense and sparse subgraphs of weakly closed graphs
• Can local optimality be used for efficient data reduction?
• Graph parameters, implicit representations and factorial properties
• The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics
• An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems
• The Micro-world of Cographs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3143753)