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

DOI10.1007/978-3-642-03367-4_25zbMath1253.68107OpenAlexW1620903941MaRDI QIDQ3183462

Emma S. Spiro, David Eppstein

Publication date: 20 October 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03367-4_25

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Related Items (8)

The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics ⋮ Local community detection based on small cliques ⋮ Quasi-Laplacian centrality: a new vertex centrality measurement based on quasi-Laplacian energy of networks ⋮ Tell me who you are friends with and I will tell you who you are: unique neighborhoods in random graphs ⋮ Arboricity, \(h\)-index, and dynamic algorithms ⋮ On linear algebraic algorithms for the subgraph matching problem and its variants ⋮ Fast maximal cliques enumeration in sparse graphs ⋮ Extended dynamic subgraph statistics using \(h\)-index parameterized data structures

Uses Software

• Pajek
• Pajek datasets
• statnet
• Ucinet

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An index to quantify an individual's scientific research output
• Finding and counting small induced subgraphs efficiently
• Finding and counting given length cycles
• Logit models and logistic regressions for social networks. I: An introduction to Markov graphs and \(p^*\)
• On the complexity of fixed parameter clique and dominating set
• Finding and counting cliques and independent sets in \(r\)-uniform hypergraphs
• Matrix multiplication via arithmetic progressions
• Arboricity and bipartite subgraph listing algorithms
• Diameter and treewidth in minor-closed graph families
• The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics
• Arboricity and Subgraph Listing Algorithms
• Markov Graphs
• Statistical analysis of change in networks
• Finding a Minimum Circuit in a Graph
• Connectivity, graph minors, and subgraph multiplicity
• The Structure and Function of Complex Networks
• Subgraph Isomorphism in Planar Graphs and Related Problems
• A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph
• Finding, minimizing, and counting weighted subgraphs

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