Skip to main navigation Skip to search Skip to main content

Faster algorithms for finding lowest common ancestors in directed acyclic graphs

Artur Czumaj, Miroslaw Kowaluk, Andrzej Lingas

    Research output: Contribution to journal › Article › peer-review

    Fingerprint

    Dive into the research topics of 'Faster algorithms for finding lowest common ancestors in directed acyclic graphs'. Together they form a unique fingerprint.
    Sort by

    Mathematics

    Computer Science