Computing quartet distance is equivalent to counting 4-cycles

DOI10.1145/3313276.3316390zbMath1433.68169arXiv1811.06244OpenAlexW2964236121MaRDI QIDQ5212813

Paweł Gawrychowski, Bartłomiej Dudek

Publication date: 30 January 2020

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

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

zbMATH Keywords

quartet distancefine-grained complexitycounting 4-cycles

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Problems related to evolution (92D15) Enumeration in graph theory (05C30) Paths and cycles (05C38)

Related Items (2)

Cache Oblivious Algorithms for Computing the Triplet Distance between Trees ⋮ Unnamed Item

This page was built for publication: Computing quartet distance is equivalent to counting 4-cycles