Skip to main content

and
  1. No Access

    Chapter and Conference Paper

    Time-Space Trade-Offs for Computing Euclidean Minimum Spanning Trees

    In the limited-workspace model, we assume that the input of size n lies in a random access read-only memory. The output has to be reported sequentially, and it cannot be accessed or modified. In addition, there i...

    Bahareh Banyassady, Luis Barba, Wolfgang Mulzer in LATIN 2018: Theoretical Informatics (2018)