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 …

Research on space efficient graph algorithms, particularly for st-connectivity, has a long
history including the celebrated polynomial time, O (lg n) bits 1 algorithm in undirected …

Recent work by Elmasry et al.(STACS 2015) and Asano et al.(ISAAC 2014), reconsidered
classical fundamental graph algorithms focusing on improving the space complexity …

We revisit the read-only random-access model, in which the input array is read-only and a
limited amount of workspace is allowed. Given a set of N two-dimensional points in a read …

We describe space-efficient algorithms for two problems on undirected multigraphs: Euler
partition (partitioning the edges into a minimum number of trails); and bipartite edge coloring …

We consider the classical selection and sorting problems in a model where the initial
permutation of the input has to be restored after completing the computation. While the …

Read-only memory (ROM) model is a classical model of computation to study time-space
tradeoffs of algorithms. A classical result on the ROM model is that any algorithm to sort n …

We revisit the random-access-machine model in which the input is given on a read-only
random-access media, the output is to be produced to a write-only sequential-access media …

We consider the classical selection and sorting problems in a model where the initial
permutation of the input has to be restored after completing thecomputation. Such algorithms …

Abstract Starting with Munro and Paterson (1980), the selection or median-finding problem
has been extensively studied in the read-only memory model and in streaming models …