A Dynamic Data Structure for Counting Subgraphs in Sparse Graphs

DOI10.1007/978-3-642-40104-6_27zbMath1390.68208arXiv1209.0375OpenAlexW2963888752MaRDI QIDQ2842169

Vojtěch Tůma, Zdeněk Dvořák

Publication date: 12 August 2013

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

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

zbMATH Keywords

sparse graphsdata structuresubgraphs

Mathematics Subject Classification ID

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

Related Items (5)

Simultaneously load balancing for every p-norm, with reassignments ⋮ On linear algebraic algorithms for the subgraph matching problem and its variants ⋮ A color-avoiding approach to subgraph counting in bounded expansion classes ⋮ Efficient algorithms for subgraph listing ⋮ Improved Dynamic Graph Coloring

This page was built for publication: A Dynamic Data Structure for Counting Subgraphs in Sparse Graphs