Drawing Trees in a Streaming Model

Binucci, C; Brandes, U; Battista, G; Didimo, W; Gaertler, M; Palladino, P; Patrignani, M; Symvonis, A; Zweig, K

dc.contributor.author	Binucci, C	en
dc.contributor.author	Brandes, U	en
dc.contributor.author	Battista, G	en
dc.contributor.author	Didimo, W	en
dc.contributor.author	Gaertler, M	en
dc.contributor.author	Palladino, P	en
dc.contributor.author	Patrignani, M	en
dc.contributor.author	Symvonis, A	en
dc.contributor.author	Zweig, K	en
dc.date.accessioned	2014-03-01T02:51:52Z
dc.date.available	2014-03-01T02:51:52Z
dc.date.issued	2009	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/35709
dc.subject	Competitive Ratio	en
dc.subject	Data Stream	en
dc.subject	Graph Drawing	en
dc.subject	Model of Computation	en
dc.subject	Quality Criteria	en
dc.title	Drawing Trees in a Streaming Model	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/978-3-642-11805-0_28	en
heal.identifier.secondary	http://dx.doi.org/10.1007/978-3-642-11805-0_28	en
heal.publicationDate	2009	en
heal.abstract	We introduce a data stream model of computation for Graph Drawing, where a source produces a graph one edge at a time. When an edge is produced, it is immediately drawn and its drawing can not be altered. The drawing has an image persistence, that controls the lifetime of edges. If the persistence is k, an edge remains in the	en
heal.journalName	Symposium on Graph Drawing	en
dc.identifier.doi	10.1007/978-3-642-11805-0_28	en