A Radial Adaptation of the Sugiyama Framework for Visualizing Hierarchical Information

Bachmaier, Christian

doi:10.1109/tvcg.2007.1000

Cited by 42 publications

(40 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…-In radial drawings of graphs, also the restricted (N P-complete) variant called radial one-sided two-level crossing minimization has been considered [4].…”

Section: Discussionmentioning

confidence: 99%

Ranking and Drawing in Subexponential Time

Fernau

Fomin

Lokshtanov

et al. 2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. In this paper we obtain parameterized subexponential-time algorithms for p-Kemeny Aggregation (p-KAGG) -a problem in social choice theory -and for p-One-Sided Crossing Minimization (p-OSCM) -a problem in graph drawing (see the introduction for definitions). These algorithms run in time O * (2, where k is the parameter, and significantly improve the previous best algorithms with running times O * (1.403 k ) and O * (1.4656 k ), respectively. We also study natural "above-guarantee" versions of these problems and show them to be fixed parameter tractable. In fact, we show that the above-guarantee versions are equivalent to a weighted variant of p-Directed Feedback Arc Set. Our results for the above-guarantee version of p-KAGG reveal an interesting contrast. We show that when the number of "votes" in the input to p-KAGG is odd the above guarantee version can still be solved in time O * (2 O( √ k log k) ), while if it is even then the problem cannot have a subexponential time algorithm unless the exponential time hypothesis fails (equivalently, unless FPT=M[1]).

show abstract

“…-In radial drawings of graphs, also the restricted (N P-complete) variant called radial one-sided two-level crossing minimization has been considered [4].…”

Section: Discussionmentioning

confidence: 99%

Ranking and Drawing in Subexponential Time

Fernau

Fomin

Lokshtanov

et al. 2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Bachmaier presented a radial version of the Sugiyama Framework [27] by placing nodes on concentric circles instead of horizontal lines and drawing edges as outward monotone segments of spirals instead of straight lines. The experiments showed that this drawing style allows more flexible edge and the number of crossings is reduced by about 30% [28].…”

Section: Non-level-based Drawingmentioning

confidence: 97%

2-D Layout for Tree Visualization: a survey

Wang

Nakanishi

Fukuda

2016

MATEC Web of Conferences

View full text Add to dashboard Cite

Abstract. This is a survey of recent researches on 2D tree visualization approaches. The whole paper will focus on 2D layouts for general trees including different styles of node-link diagram, main variations of Treemap, some solutions designed especially for mobile devices, and several hybrid approaches. We are not trying to give an exhaustive list of tree layouts here. Instead, we will introduce new ideas in the main categories of general tree layouts, which may inspire more efficient and creative designs.

show abstract

“…For our purposes an interesting reference is [11] that constructs radial drawings adapting techniques of the Sugiyama Framework, but, unfortunately, it does not deal with clusters. The algorithm in [16], which extends the one described in [15], inspired part of our work.…”

Section: The Algorithmsmentioning

confidence: 99%

Dynamic Traceroute Visualization at Multiple Abstraction Levels

et al. 2013

View full text Add to dashboard Cite

Abstract. We present a system, called TPLAY, for the visualization of the traceroutes performed by the Internet probes deployed by active measurement projects. These traceroutes are continuously executed towards selected Internet targets. TPLAY allows to look at traceroutes at different abstraction levels and to animate the evolution of traceroutes during a selected time interval. The system has been extensively tested on traceroutes performed by RIPE Atlas [22] Internet probes.

show abstract

A Radial Adaptation of the Sugiyama Framework for Visualizing Hierarchical Information

Cited by 42 publications

References 30 publications

Ranking and Drawing in Subexponential Time

Ranking and Drawing in Subexponential Time

2-D Layout for Tree Visualization: a survey

Dynamic Traceroute Visualization at Multiple Abstraction Levels

Contact Info

Product

Resources

About