Neidio i’r brif dudalen lywio Neidio i chwilio Neidio i’r prif gynnwys

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

Allbwn ymchwil: Pennod mewn Llyfr/Adroddiad/Trafodion CynhadleddCyfraniad mewn cynhadleddadolygiad gan gymheiriaid

Crynodeb

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.

Iaith wreiddiolSaesneg
TeitlICCCN 2022 - 31st International Conference on Computer Communications and Networks
CyhoeddwrInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronig)9781665497268
Dynodwyr Gwrthrych Digidol (DOIs)
StatwsCyhoeddwyd - 5 Medi 2022
Digwyddiad31st International Conference on Computer Communications and Networks, ICCCN 2022 - Virtual, Online, Yr Unol Daleithiau
Hyd: 25 Gorff 202227 Gorff 2022

Cyfres gyhoeddiadau

EnwProceedings - International Conference on Computer Communications and Networks, ICCCN
Cyfrol2022-July
ISSN (Argraffiad)1095-2055

Cynhadledd

Cynhadledd31st International Conference on Computer Communications and Networks, ICCCN 2022
Gwlad/TiriogaethYr Unol Daleithiau
DinasVirtual, Online
Cyfnod25/07/2227/07/22

Dyfynnu hyn