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

R. Lewis, F. Carroll

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationICCCN 2022 - 31st International Conference on Computer Communications and Networks
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781665497268
DOIs
Publication statusPublished - 5 Sept 2022
Event31st International Conference on Computer Communications and Networks, ICCCN 2022 - Virtual, Online, United States
Duration: 25 Jul 202227 Jul 2022

Publication series

NameProceedings - International Conference on Computer Communications and Networks, ICCCN
Volume2022-July
ISSN (Print)1095-2055

Conference

Conference31st International Conference on Computer Communications and Networks, ICCCN 2022
Country/TerritoryUnited States
CityVirtual, Online
Period25/07/2227/07/22

Keywords

  • Graph theory
  • algorithms
  • cycles
  • networks

Cite this