Structural sparsity of complex networks: bounded expansion in random models and real-world graphs
- Submitting institution
-
Birkbeck College
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 189
- Type
- D - Journal article
- DOI
-
10.1016/j.jcss.2019.05.004
- Title of journal
- Journal of Computer and System Sciences
- Article number
- -
- First page
- 199
- Volume
- 105
- Issue
- -
- ISSN
- 0022-0000
- Open access status
- Compliant
- Month of publication
- May
- Year of publication
- 2019
- URL
-
http://eprints.bbk.ac.uk/id/eprint/27714/
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
5
- Research group(s)
-
1 - Algorithms, Verification and Software
- Citation count
- 1
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper was the first to investigate the intersection of structural graph theory and real-world graphs in a broad, algorithmically relevant manner. The work led to an interdisciplinary collaboration with computational geneticists from UC Davis in which we applied techniques from our research to metagenome networks and devised a novel approach to extract information in a biologically significant way.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -