Extended dynamic subgraph statistics using \(h\)-index parameterized data structures

DOI10.1016/j.tcs.2011.11.034zbMath1246.68170arXiv1009.0783OpenAlexW1484258308MaRDI QIDQ443712

Lowell Trott, Darren Strash, Michael T. Goodrich, David Eppstein

Publication date: 13 August 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1009.0783

zbMATH Keywords

subgraphparameterized algorithm\(h\)-indexdynamic graph algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05)

Related Items (2)

Quasipolynomiality of the Smallest Missing Induced Subgraph ⋮ On linear algebraic algorithms for the subgraph matching problem and its variants

Cites Work

• An index to quantify an individual's scientific research output
• Finding and counting given length cycles
• Logit models and logistic regressions for social networks. I: An introduction to Markov graphs and \(p^*\)
• Matrix multiplication via arithmetic progressions
• Diameter and treewidth in minor-closed graph families
• Fixed-parameter algorithms for ( k , r )-center in planar graphs and map graphs
• 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
• On efficient fixed-parameter algorithms for weighted vertex cover
• The Structure and Function of Complex Networks
• Subgraph Isomorphism in Planar Graphs and Related Problems
• Fixed-Parameter Tractability and Completeness I: Basic Results

This page was built for publication: Extended dynamic subgraph statistics using \(h\)-index parameterized data structures