# Planarity of Streamed Graphs

@inproceedings{Lozzo2015PlanarityOS,
title={Planarity of Streamed Graphs},
author={G. D. Lozzo and I. Rutter},
booktitle={CIAC},
year={2015}
}
• Published in CIAC 2015
• Mathematics, Computer Science
• 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 $$e_1,e_2,\dots ,e_m$$ on a vertex set $$V$$. A streamed graph is $$\omega$$-stream planar with respect to a positive integer window size $$\omega$$ if there exists a sequence of planar topological drawings $$\varGamma _i$$ of the graphs $$G_i=V,\{e_j \mid i\le j < i+\omega \}$$ such that the common graph $$G^{i}_\cap =G_i\cap G_{i+1}$$ is drawn the same… CONTINUE READING

#### Explore Further: Topics Discussed in This Paper

Planarity of streamed graphs
• Computer Science, Mathematics
• 2019
1
Graph Stories in Small Area
• Mathematics, Computer Science
• 2019
1
Windrose Planarity
5
Hierarchical Partial Planarity
• Computer Science, Mathematics
• 2017
2

#### References

##### Publications referenced by this paper.
SHOWING 1-10 OF 18 REFERENCES