You are currently offline. Some features of the site may not work correctly.

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