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

DOI10.1007/978-3-642-03367-4_25MaRDI QIDQ3183462zbMATH OpenOpenAlexFDO

Authors David Eppstein, Emma S. Spiro

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)

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
• Arboricity, \(h\)-index, and dynamic algorithms
• Efficient triangle counting in large graphs via degree-based vertex partitioning

Cites work

• scientific article; zbMATH DE number 1617242 (Why is no real title available?)
• scientific article; zbMATH DE number 2084315 (Why is no real title available?)
• scientific article; zbMATH DE number 3910446 (Why is no real title available?)
• A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph
• An index to quantify an individual's scientific research output
• Arboricity and Subgraph Listing Algorithms
• Arboricity and bipartite subgraph listing algorithms
• Citation statistics: A joint report of the International Mathematical Union (IMU), the International Council for Industrial and Applied Mathematics (ICIAM) and the Institute of Mathematical Statistics (IMS)
• Connectivity, graph minors, and subgraph multiplicity
• Diameter and treewidth in minor-closed graph families
• Finding a Minimum Circuit in a Graph
• Finding and counting cliques and independent sets in \(r\)-uniform hypergraphs
• Finding and counting given length cycles
• Finding and counting small induced subgraphs efficiently
• Finding, minimizing, and counting weighted subgraphs
• Logit models and logistic regressions for social networks. I: An introduction to Markov graphs and \(p^*\)
• Markov Graphs
• Matrix multiplication via arithmetic progressions
• On the complexity of fixed parameter clique and dominating set
• Statistical analysis of change in networks
• Subgraph Isomorphism in Planar Graphs and Related Problems
• The Structure and Function of Complex Networks
• The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics

Cited in

(10)

• 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
• Extended dynamic subgraph statistics using \(h\)-index parameterized data structures
• Extended dynamic subgraph statistics using h-index parameterized data structures
• Arboricity, \(h\)-index, and dynamic algorithms
• Local community detection based on small cliques
• On linear algebraic algorithms for the subgraph matching problem and its variants
• The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics
• Fast maximal cliques enumeration in sparse graphs
• The h-Index of a Graph and its Application to Dynamic Subgraph Statistics

Describes a project that uses

Uses Software

• Ucinet
• statnet
• Pajek datasets
• Pajek

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 Q3183462)