most citedFinding Euler Tours in One Pass in the W-Streaming Model with O(n log(n)) RAM

1 citations · 1 across the 2 of their papers we have counts for

collaborators
Showing cs.DSShow all

2 papers · 1 filter

cs.DS2017★ 1 cited

Finding Euler Tours in One Pass in the W-Streaming Model with O(n log(n)) RAM

Christian Glazik, Jan Schiemann, Anand Srivastav

We study the problem of finding an Euler tour in an undirected graph G in the W-Streaming model with O(n polylog(n)) RAM, where n resp. m is the number of nodes resp. edges of G. O…

cs.DS2016

Finding Euler Tours in the StrSort Model

Lasse Kliemann, Jan Schiemann, Anand Srivastav

We present a first algorithm for finding Euler tours in undirected graphs in the StrSort model. This model is a relaxation of the semi streaming model. The graph is given as a stre…