A Color-Avoiding Approach to Subgraph Counting in Bounded Expansion Classes
- 3 February 2023
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 85 (8) , 2318-2347
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Gordon and Betty Moore Foundation (GBMF4560)
This publication has 17 references indexed in Scilit:
- Hyperbolicity, Degeneracy, and Expansion of Random Intersection Graphs2015
- Constant-factor approximation of the domination number in sparse graphsEuropean Journal of Combinatorics, 2013
- A Dynamic Data Structure for Counting Subgraphs in Sparse Graphs2013
- On nowhere dense graphsEuropean Journal of Combinatorics, 2011
- Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time2010
- Colouring graphs with bounded generalized colouring numberDiscrete Mathematics, 2009
- Grad and classes with bounded expansion I. DecompositionsEuropean Journal of Combinatorics, 2008
- Understanding the Complexity of Induced Subgraph Isomorphisms2008
- The Parameterized Complexity of Counting ProblemsSIAM Journal on Computing, 2004
- Orderings on Graphs and Game Coloring NumberOrder, 2003