Efficient computation of distance labeling for decremental updates in large dynamic graphs
- Submitting institution
-
The University of Huddersfield
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 22
- Type
- D - Journal article
- DOI
-
10.1007/s11280-016-0421-1
- Title of journal
- World Wide Web
- Article number
- -
- First page
- 915
- Volume
- 20
- Issue
- 5
- ISSN
- 1386-145X
- Open access status
- Compliant
- Month of publication
- October
- Year of publication
- 2016
- URL
-
-
- 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
-
4
- Research group(s)
-
-
- Citation count
- 2
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Published in an ERA2010 "A" rated journal, this paper describes novel index structures and algorithms to solve the challenging problem of computing the shortest path distance in large dynamic graphs. The research has already been utilised by leading academics in the field of Combinatorics and Graph Algorithms, using it to confirm labelling order is decisive in determining the size of the constructed distance labelling https://arxiv.org/abs/1812.02363 and to confirm that it is non-trivial to extend the distance labelling technique to handle dynamic graphs using multiple cores, which leads to the motivation and inspiration for the use of parallel algorithms https://dl.acm.org/doi/abs/10.1145/3299869.3319877
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -