Corpus ID: 3381591

Counting small subgraphs in multi-layer networks

@article{Enright2017CountingSS,
  title={Counting small subgraphs in multi-layer networks},
  author={J. Enright and K. Meeks},
  journal={ArXiv},
  year={2017},
  volume={abs/1710.08758}
}
Motivated by the prevalence of multi-layer network structures in biological and social systems, we investigate the problem of counting the number of occurrences of (small) subgraphs or motifs in multi-layer graphs in which each layer of the graph has useful structural properties. Making use of existing meta-theorems, we focus on the parameterised complexity of motif-counting problems, giving conditions on the layers of a graph that yield fixed-parameter tractable algorithms for motif-counting… Expand
1 Citations
Efficiently counting complex multilayer temporal motifs in large-scale networks
  • 2
  • Highly Influenced

References

SHOWING 1-10 OF 48 REFERENCES
The parameterised complexity of counting connected subgraphs and graph motifs
  • 28
  • PDF
The challenges of unbounded treewidth in parameterised subgraph counting problems
  • K. Meeks
  • Mathematics, Computer Science
  • Discret. Appl. Math.
  • 2016
  • 28
  • PDF
Homomorphisms are a good basis for counting small subgraphs
  • 77
  • PDF
Complexity of Counting Subgraphs: Only the Boundedness of the Vertex-Cover Number Counts
  • Radu Curticapean, D. Marx
  • Mathematics, Computer Science
  • 2014 IEEE 55th Annual Symposium on Foundations of Computer Science
  • 2014
  • 62
  • PDF
On the parameterized complexity of multiple-interval graph problems
  • 293
  • PDF
Networks: An Introduction
  • 8,683
Understanding the Complexity of Induced Subgraph Isomorphisms
  • 49
  • PDF
Multilayer networks
  • 1,844
  • PDF
...
1
2
3
4
5
...