Finding even cycles faster via capped k-walks

DOI10.1145/3055399.3055459zbMath1369.05192arXiv1703.10380OpenAlexW2604969355WikidataQ61971574 ScholiaQ61971574MaRDI QIDQ4977965

Morten Stöckel, Søren Dahlgaard, Mathias Bæk Tejs Knudsen

Publication date: 17 August 2017

Published in: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1703.10380

zbMATH Keywords

cyclesgraph algorithmsparameterized algorithmsconditional lower boundsgraph walkscapped walks

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Unnamed Item ⋮ Graph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced Cycles

This page was built for publication: Finding even cycles faster via capped k-walks