{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Compiler - Layered Graph Drawing(Sugiyama Method Drawing...

Info icon This preview shows pages 1–15. Sign up to view the full content.

View Full Document Right Arrow Icon
Layered Graph Drawing (Sugiyama Method)
Image of page 1

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Drawing Conventions and Aesthetics a digraph A possible layered drawing
Image of page 2
The Sugiyama method Layered networks are often used to represent dependency relations. Sugiyama et al. developed a simple method for drawing layered networks in 1979. Sugiyama’s aims included: few edge crossings edges as straight as possible nodes spread evenly over the page The Sugiyama method is useful for dependency diagrams flow diagrams conceptual lattices other directed graphs: acyclic or nearly acyclic.
Image of page 3

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
The Sugiyama method
Image of page 4
The Sugiyama method Step 2 Step 2 Layering Layering Step 1 Step 1 Cycle Removal Cycle Removal
Image of page 5

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
The Sugiyama method Step 2 Step 2 Layering Layering Step 3 Step 3 Node ordering Node ordering Step 1 Step 1 Cycle Removal Cycle Removal
Image of page 6
Step 2 Step 2 Layering Layering Step 3 Step 3 Node ordering Node ordering Step 4 Step 4 Coordinate  Coordinate  assignment assignment The Sugiyama method Step 1 Step 1 Cycle Removal Cycle Removal
Image of page 7

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Layered Drawing of Digraphs Polyline drawings of digraphs with vertices arranged in horizontal layers Sugiyama, Tagawa and Toda ‘81 Eades and Sugiyama ‘91 Evolutionary algorithm approach of Branke et al. Magnetic field approach of Sugiyama and Misue. Attractive in practice: most graph drawing systemsinclude the Sugiyama method.
Image of page 8
Step 1. Cycle Removal Input graph may contain cycles 1. make an acyclic digraph by reversing some edges 2. draw the acyclic graphs 3. render the drawing with the original edge directions Acyclic graph by reversing two edges
Image of page 9

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Step 1. Cycle Removal Each cycle must have at least one edge against the flow We need to keep the number of edges against the flow small Main problem: how to choose the set of edges R so that it is small Feedback arc set: set of edges R whose reversing makes the digraph acyclic Feedback edge set: set of edges whose removal makes the digraph acyclic Maximum acyclic subgraph problem find a maximum set Ea such that the graph(V, Ea) contains no cycles : NP-hard Feedback arc set problem find a minimum set Ef such that the graph(V, E \ Ef) contains no cycles : NP-hard
Image of page 10
Step 1. Cycle Removal Edges in E \ Ea will be reversed Assume no two-cycles (or delete both two edges) Heuristics 1. Fast heuristic 2. Enhanced Greedy heuristic 3. Randomized algorithm:[BS90]: O(mn) time Exact algorithm: [Grotschel et al 85, Reinelt 85]
Image of page 11

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Maximum acyclic subgraph problem equivalent to unweighted linear ordering problem: find an ordering of the vertices, a mapping o such that the # of edges (u,v), o (u) > o (v) is minimized. Easiest heuristic take an arbitrary ordering then delete the edges (u,v) with o (u) > o (v) May use given ordering: BFS or DFS No performance guarantee: reverse |E|-|V|-1 edges (DFS) Heuristic that guarantees acyclic set of size at least ½|E| [BS90] Delete for every vertex either incoming or outgoing edges Linear time 1. Fast heuristic
Image of page 12
1. Fast heuristic [BS90]
Image of page 13

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
2. Enhanced greedy heuristic
Image of page 14
Image of page 15
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern