English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In streamed graph drawing, a planar graph, G, is given incrementally as adata stream and a straight-line drawing of G must be updated after each newedge is released. To preserve the mental map, changes to the drawing should beminimized after each update, and Binucci et al.show that exponential area isnecessary and sufficient for a number of streamed graph drawings for trees ifedges are not allowed to move at all. We show that a number of streamed graphdrawings can, in fact, be done with polynomial area, including planar streamedgraph drawings of trees, tree-maps, and outerplanar graphs, if we allow for asmall number of coordinate movements after each update. Our algorithms involvean interesting connection to a classic algorithmic problem - the filemaintenance problem - and we also give new algorithms for this problem in aframework where bulk memory moves are allowed.

Streamed Graph Drawing and the File Maintenance Problem