Planarity of Streamed Graphs

@inproceedings{Lozzo2015PlanarityOS,
  title={Planarity of Streamed Graphs},
  author={G. D. Lozzo and I. Rutter},
  booktitle={CIAC},
  year={2015}
}
  • G. D. Lozzo, I. Rutter
  • 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
    Planarity of streamed graphs
    1
    Graph Stories in Small Area
    1
    Windrose Planarity
    5
    Hierarchical Partial Planarity
    2

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 18 REFERENCES
    On-Line Planarity Testing
    216
    Recognizing string graphs in NP
    88
    Fast Algorithms for Finding Nearest Common Ancestors
    1080
    Drawing Non-Planar Graphs with Crossing-Free Subgraphs
    3
    Picking Planar Edges; or, Drawing a Graph with a Planar Subgraph
    6
    Drawing trees in a streaming model
    19