Listing, verifying and counting lowest common ancestors in DAGs: Algorithms and fine-grained lower bounds

DOI10.4230/LIPICS.ICALP.2022.94MaRDI QIDQ6560892zbMATH OpenFDO

Authors Surya Mathialagan, Williams Virginia Vassilevska, Yinzhan Xu

Publication date 24 June 2024

zbMATH Keywords

fine-grained complexityall-pairs lowest common ancestor

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

This page was built for publication: Listing, verifying and counting lowest common ancestors in DAGs: Algorithms and fine-grained lower bounds

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