Three-in-a-tree in near linear time

DOI10.1145/3357713.3384235OpenAlexW3034687855MaRDI QIDQ5145012

Kai-Yuan Lai, Hsueh-I Lu, Mikkel Thorup

Publication date: 19 January 2021

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

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

zbMATH Keywords

perfect graphSPQR-treedynamic graph algorithmtop treeodd holegraph recognitioneven holeinduced subgraph detection

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items

Detecting a long even hole, Induced subgraphs and tree decompositions. I: Even-hole-free graphs of bounded degree, MIP formulations for induced graph optimization problems: a tutorial, Finding a shortest even hole in polynomial time, FPT and kernelization algorithms for the induced tree problem, Detecting a long odd hole, Induced disjoint paths in AT-free graphs