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

Da Lozzo, G., Rutter, I. (2019). Planarity of streamed graphs. THEORETICAL COMPUTER SCIENCE, 799, 1-21 [10.1016/j.tcs.2019.09.029].

Planarity of streamed graphs

Da Lozzo G.;
2019-01-01

Abstract

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
2019
Da Lozzo, G., Rutter, I. (2019). Planarity of streamed graphs. THEORETICAL COMPUTER SCIENCE, 799, 1-21 [10.1016/j.tcs.2019.09.029].
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11590/360559
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 8
  • ???jsp.display-item.citation.isi??? 6
social impact