Hi-tree Layout Using Quadratic Programming

Autor:	Peter Sbarski, Kim Marriott, Tim Dwyer
Rok vydání:	2010
Předmět:	Tree (data structure) Mathematical optimization Quadratically constrained quadratic program Mathematical software Second-order cone programming Directed graph Quadratic programming Solver Mathematics Sequential quadratic programming
Zdroj:	Diagrammatic Representation and Inference ISBN: 9783642145995 Diagrams Monash University
DOI:	10.1007/978-3-642-14600-8_20
Popis:	Horizontal placement of nodes in tree layout or layered drawings of directed graphs can be modelled as a convex quadratic program. Thus, quadratic programming provides a declarative framework for specifying such layouts which can then be solved optimally with a standard quadratic programming solver. While slower than specialized algorithms, the quadratic programming approach is fast enough for practical applications and has the great benefit of being flexible yet easy to implement with standard mathematical software. We demonstrate the utility of this approach by using it to layout hi-trees. These are a tree-like structure with compound nodes recently introduced for visualizing the logical structure of arguments and of decisions.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cc18cb75490e6bdf95270419dba4af58 https://doi.org/10.1007/978-3-642-14600-8_20 Zobrazit plný text záznamu