Extended dynamic subgraph statistics using h-index parameterized data structures

DOI10.1007/978-3-642-17458-2_12MaRDI QIDQ3066151zbMATH OpenOpenAlexFDO

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

Publication date 8 January 2011

Published in Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-17458-2_12

Mathematics Subject Classification ID

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

Recommendations

• Extended dynamic subgraph statistics using \(h\)-index parameterized data structures
• The h-Index of a Graph and its Application to Dynamic Subgraph Statistics
• The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics
• A dynamic data structure for counting subgraphs in sparse graphs
• Arboricity, \(h\)-index, and dynamic algorithms

Cited in

(7)

• The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics
• A dynamic data structure for counting subgraphs in sparse graphs
• Extended dynamic subgraph statistics using \(h\)-index parameterized data structures
• Summarized bit batch-based triangle listing in massive graphs
• Counting subgraphs in relational event graphs
• The h-Index of a Graph and its Application to Dynamic Subgraph Statistics
• iTri: index-based triangle listing in massive graphs

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

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