Cardiff Metropolitan University
Browse
ExactIEEE.pdf (247.5 kB)

Exact Algorithms for Finding Fixed-Length Cycles in Edge-Weighted Graphs

Download (247.5 kB)
conference contribution
posted on 2023-10-09, 11:18 authored by Rhyd Lewis, Fiona CarrollFiona Carroll

 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. 

History

Presented at

2022 International Conference on Computer Communications and Networks (ICCCN), 25-28 July 2022. Honolulu, HI, USA

Publisher

IEEE

Version

  • 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.9868939

Electronic ISSN

2637-9430

ISBN

9781665497275

Cardiff Met Authors

Fiona Carroll

Copyright Holder

  • © The Publisher

Language

  • en

Usage metrics

    School of Technologies Research - Conference Papers

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC