O(n log log n)-work parallel algorithms for straight-line grid embeddings of planar graphs

Martin Fuerer, Xin He, Ming Yang Kao, Balaji Raghavachari

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    4 Scopus citations

    Fingerprint

    Dive into the research topics of 'O(n log log n)-work parallel algorithms for straight-line grid embeddings of planar graphs'. Together they form a unique fingerprint.

    Engineering & Materials Science