Three-in-a-tree in near linear time

DOI10.1145/3357713.3384235OpenAlexW3034687855MaRDI QIDQ5145012FDOQ5145012

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)

Cited In (9)

• Induced disjoint paths in AT-free graphs
• Finding a shortest even hole in polynomial time
• FPT and kernelization algorithms for the induced tree problem
• Detecting a long even hole
• MIP formulations for induced graph optimization problems: a tutorial
• Detecting a long odd hole
• The three-in-a-tree problem
• Blazing a trail via matrix multiplications: a faster algorithm for non-shortest induced paths
• Induced subgraphs and tree decompositions. I: Even-hole-free graphs of bounded degree

This page was built for publication: Three-in-a-tree in near linear time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145012)