Lewis, R.  ORCID: https://orcid.org/0000-0003-1046-811X and Carroll, F.
2022.
Exact algorithms for finding fixed-length cycles in edge-weighted graphs.
Presented at: 2022 International Conference on Computer Communications and Networks (ICCCN),
25-28 July 2022.
2022 International Conference on Computer Communications and Networks (ICCCN).
IEEE,
10.1109/ICCCN54977.2022.9868939
|
Preview |
PDF
- Accepted Post-Print Version
Download (253kB) | Preview |
Official URL: http://dx.doi.org/10.1109/ICCCN54977.2022.9868939
Abstract
We 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.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Date Type: | Published Online |
| Status: | Published |
| Schools: | Schools > Mathematics |
| Publisher: | IEEE |
| ISBN: | 9781665497275 |
| ISSN: | 1095-2055 |
| Date of First Compliant Deposit: | 17 October 2022 |
| Date of Acceptance: | 25 April 2022 |
| Last Modified: | 05 Sep 2023 01:30 |
| URI: | https://orca.cardiff.ac.uk/id/eprint/153446 |
Actions (repository staff only)
 |
Edit Item |
Altmetric
Altmetric