Planarity of streamed graphs
Giordano Da Lozzo, Ignaz Rutter · Iris (Roma Tre University) · 2019
In this paper we introduce a notion of planarity for graphs that are presented in a streaming fashion. A streamed graph is a stream of edges e1,e2,...,em on a vertex set V. A streamed graph is ω-stream planar with respect to a positive integer window size ω if there exists a sequence of planar topological drawings Γi of the graphs Gi=(V,ej|i≤j