Drawing trees in a streaming model

DSpace/Manakin Repository

Show simple item record

dc.contributor.author Binucci, C en
dc.contributor.author Brandes, U en
dc.contributor.author Di 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:08:41Z
dc.date.available 2014-03-01T02:08:41Z
dc.date.issued 2012 en
dc.identifier.issn 00200190 en
dc.identifier.uri http://hdl.handle.net/123456789/29705
dc.subject Design of algorithms en
dc.subject Graph algorithms en
dc.subject Graph drawing en
dc.subject Large graphs en
dc.subject Online algorithms en
dc.subject Streaming en
dc.subject.other Design of algorithms en
dc.subject.other Graph algorithms en
dc.subject.other Graph drawing en
dc.subject.other Large graphs en
dc.subject.other On-line algorithms en
dc.subject.other Acoustic streaming en
dc.subject.other Drawing (graphics) en
dc.subject.other Forestry en
dc.subject.other Visualization en
dc.subject.other Algorithms en
dc.subject.other Algorithms en
dc.subject.other Drawings en
dc.subject.other Forestry en
dc.title Drawing trees in a streaming model en
heal.type journalArticle en
heal.identifier.primary 10.1016/j.ipl.2012.02.011 en
heal.identifier.secondary http://dx.doi.org/10.1016/j.ipl.2012.02.011 en
heal.publicationDate 2012 en
heal.abstract We pose a new visualization challenge, asking Graph Drawing algorithms to cope with the requirements of Streaming applications. In this model a source produces a graph one edge at a time. When an edge is produced, it is immediately drawn and its placement cannot be altered. The drawing has an image persistence, that controls the lifetime of edges. If the persistence is k, an edge remains in the drawing for the time spent by the source to generate k edges, and then it fades away. In this model we study the area requirement of planar straight-line grid drawings of trees and we assess the output quality of the presented algorithms by computing the competitive ratio with respect to the best known offline algorithms. © 2012 Elsevier B.V. All rights reserved. en
heal.journalName Information Processing Letters en
dc.identifier.doi 10.1016/j.ipl.2012.02.011 en
dc.identifier.volume 112 en
dc.identifier.issue 11 en
dc.identifier.spage 418 en
dc.identifier.epage 422 en

Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record