Exercise 1 (page 378, line 5) Describe in your own words how the operations lookup, min, max, succ, pred are carried out, and what the time complexity is. Exercise 2 (page 379, line -8) Describe howâ€¦ (More)

32 that a canonical ordering or a 4-connected triangular planar graph is possible, in which every vertex v k has out(v k) 2, which decreases the width of a visibility representation by a factor 2.â€¦ (More)

The following two computational problems are studied: Duplicate grouping: Assume that n items are given, each of which is labeled by an integer key from the set {0, . . . , U âˆ’ 1}. Store the items inâ€¦ (More)

We show that <italic>n</italic> integers in the range 1..<italic>n</italic> can be stably sorted on an EREW PRAM using <italic>O</italic>((log <italic>n</italic>)<supscrpt>1/2</supscrpt>) time,â€¦ (More)

We describe the first parallel algorithm with optimal speedup for constructing minimum-width tree decompositions of graphs of bounded treewidth. On n-vertex input graphs, the algorithm works inâ€¦ (More)

We reconsider basic algorithmic graph problems in a setting where an n-vertex input graph is read-only and the computation must take place in a working memory of O(n) bits or little more than that.â€¦ (More)