2010
DOI: 10.1007/978-3-642-11805-0_35
|View full text |Cite
|
Sign up to set email alerts
|

Drawing Directed Graphs Clockwise

Abstract: We present a method for clockwise drawings of directed cyclic graphs. It is based on the eigenvalue decomposition of a skew-symmetric matrix associated with the graph and draws edges clockwise around the center instead of downwards, as in the traditional hierarchical drawing style. The method does not require preprocessing for cycle removal or layering, which often involves computationally hard problems. We describe an efficient algorithm which produces optimal solutions, and we present some application exampl… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2012
2012
2012
2012

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 13 publications
0
1
0
Order By: Relevance
“…Sugiyama and Misue [30] use a force-based algorithm to obtain a cyclic edge orientation. Pich [23] supplies spectral graph layout techniques to generate cyclic drawings of directed graphs. Both approaches do not draw recurrent hierarchies, since they do not preserve the given leveling of the vertices.…”
Section: Introductionmentioning
confidence: 99%
“…Sugiyama and Misue [30] use a force-based algorithm to obtain a cyclic edge orientation. Pich [23] supplies spectral graph layout techniques to generate cyclic drawings of directed graphs. Both approaches do not draw recurrent hierarchies, since they do not preserve the given leveling of the vertices.…”
Section: Introductionmentioning
confidence: 99%