Structural sparsity of complex networks: Bounded expansion in random models and real-world graphs
This research establishes that many real-world networks exhibit bounded expansion2, a strong notion of structural sparsity, and demonstrates that it can be leveraged to design efficient algorithms for network analysis. Specifically, we give a new linear-time fpt algorithm for motif counting and line...
Main Author: | |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
Elsevier BV,
2021-01-26T13:47:06Z.
|
Subjects: | |
Online Access: | Get fulltext |