Exact Algorithms for Finding Fixed-Length Cycles in Edge-Weighted Graphs
conference contribution
posted on 2023-10-09, 11:18 authored by Rhyd Lewis, Fiona CarrollFiona CarrollWe describe our recent work on the problem of producing fixed-length cycles in edge-weighted graphs. We give two exact methods for this NP−hard problem and briefly consider their scaling-up characteristics.
History
Presented at
2022 International Conference on Computer Communications and Networks (ICCCN), 25-28 July 2022. Honolulu, HI, USAPublisher
IEEEVersion
- AM (Accepted Manuscript)
Citation
Lewis, R. and Carroll, F. (2022) Exact algorithms for finding fixed-length cycles in edge-weighted graphs. In 2022 International Conference on Computer Communications and Networks (ICCCN) (pp. 1-2). IEEE. https://doi.org/10.1109/ICCCN54977.2022.9868939Electronic ISSN
2637-9430ISBN
9781665497275Cardiff Met Authors
Fiona CarrollCopyright Holder
- © The Publisher
Language
- en
