The Rectilinear Symmetric Crossing Minimization Problem Seokhee Hong The University of Sydney.

Slides:



Advertisements
Similar presentations
Planar graphs Algorithms and Networks. Planar graphs2 Can be drawn on the plane without crossings Plane graph: planar graph, given together with an embedding.
Advertisements

8.1 Prisms, Area and Volume Prism – 2 congruent polygons lie in parallel planes corresponding sides are parallel. corresponding vertices are connected.
Covers, Dominations, Independent Sets and Matchings AmirHossein Bayegan Amirkabir University of Technology.
Minimum Vertex Cover in Rectangle Graphs
Orthogonal Drawing Kees Visser. Overview  Introduction  Orthogonal representation  Flow network  Bend optimal drawing.
Divide and Conquer: Rooted Trees. 2 Introduction Rooted trees: acyclic graphs (no cycles) all edges directed away from root. downward planar drawing (child.
Approximation Algorithms Chapter 5: k-center. Overview n Main issue: Parametric pruning –Technique for approximation algorithms n 2-approx. algorithm.
S. J. Shyu Chap. 1 Introduction 1 The Design and Analysis of Algorithms Chapter 1 Introduction S. J. Shyu.
Seminar Graph Drawing H : Introduction to Graph Drawing Jesper Nederlof Roeland Luitwieler.
CS774. Markov Random Field : Theory and Application Lecture 17 Kyomin Jung KAIST Nov
The number of edge-disjoint transitive triples in a tournament.
The Analysis and Design of Approximation Algorithms for the Maximum Induced Planar Subgraph Problem Kerri Morgan Supervisor: Dr. G. Farr.
Stephane Durocher 1 Debajyoti Mondal 1 Rahnuma Islam Nishat 2 Sue Whitesides 2 1 Department of Computer Science, University of Manitoba 2 Department of.
Graph Drawing Introduction 2005/2006. Graph Drawing: Introduction2 Contents Applications of graph drawing Planar graphs: some theory Different types of.
A New Force-Directed Graph Drawing Method Based on Edge- Edge Repulsion Chun-Cheng Lin and Hsu-Chen Yen Department of Electrical Engineering, National.
Recent Development on Elimination Ordering Group 1.
1 -1 Chapter 1 Introduction Why Do We Need to Study Algorithms? To learn strategies to design efficient algorithms. To understand the difficulty.
Computational Geometry Seminar Lecture 4 More on straight-line embeddings Gennadiy Korol.
Vertex Cover, Dominating set, Clique, Independent set
Graphic Tool for Computer Chip Layout Laura McLane Saint Michael’s College Advisor: Joanna Ellis-Monaghan.
CSE 6405 Graph Drawing Text Books T. Nishizeki and M. S. Rahman, Planar Graph Drawing, World Scientific, Singapore, G. Di Battista,
SIMS 247: Information Visualization and Presentation jeffrey heer
2IL90: Graph Drawing Introduction Fall Graphs  Vertices  Edges.
Chapter 9 Graph algorithms Lec 21 Dec 1, Sample Graph Problems Path problems. Connectedness problems. Spanning tree problems.
Last class Decision/Optimization 3-SAT  Independent-Set Independent-Set  3-SAT P, NP Cook’s Theorem NP-hard, NP-complete 3-SAT  Clique, Subset-Sum,
2-Layer Crossing Minimisation Johan van Rooij. Overview Problem definitions NP-Hardness proof Heuristics & Performance Practical Computation One layer:
Coloring Algorithms and Networks. Coloring2 Graph coloring Vertex coloring: –Function f: V  C, such that for all {v,w}  E: f(v)  f(w) Chromatic number.
1 Refined Search Tree Technique for Dominating Set on Planar Graphs Jochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Fran.
Constant Factor Approximation of Vertex Cuts in Planar Graphs Eyal Amir, Robert Krauthgamer, Satish Rao Presented by Elif Kolotoglu.
Part I: Introductory Materials Introduction to Graph Theory Dr. Nagiza F. Samatova Department of Computer Science North Carolina State University and Computer.
TECH Computer Science Graph Optimization Problems and Greedy Algorithms Greedy Algorithms  // Make the best choice now! Optimization Problems  Minimizing.
CSE53111 Computational Geometry TOPICS q Preliminaries q Point in a Polygon q Polygon Construction q Convex Hulls Further Reading.
Graph partition in PCB and VLSI physical synthesis Lin Zhong ELEC424, Fall 2010.
I NTRODUCTION TO G RAPH DRAWING Fall 2010 Battista, G. D., Eades, P., Tamassia, R., and Tollis, I. G Graph Drawing: Algorithms for the Visualization.
Crossing Minimisation (1) Ronald Kieft. Global contents Specific 2-layer Crossing Minimisation techniques After the break, by Johan Crossing Minimisation.
Graph Partitioning Problem Kernighan and Lin Algorithm
1 Introduction to Approximation Algorithms. 2 NP-completeness Do your best then.
CSIE in National Chi-Nan University1 Approximate Matching of Polygonal Shapes Speaker: Chuang-Chieh Lin Advisor: Professor R. C. T. Lee National Chi-Nan.
Advanced Seminar on Graph Drawing – Planar Orientations Olga Maksin Victor Makarenkov Department of Computer Science. Ben-Gurion University of the Negev.
Fan-planar Graphs: Combinatorial Properties and Complexity results Carla Binucci, Emilio Di Giacomo, Walter Didimo, Fabrizio Montecchiani, Maurizio Patrignani,
Chapter 15 Approximation Algorithm Introduction Basic Definition Difference Bounds Relative Performance Bounds Polynomial approximation Schemes Fully Polynomial.
Center for Graphics and Geometric Computing, Technion 1 Computational Geometry Chapter 8 Arrangements and Duality.
Week 10Complexity of Algorithms1 Hard Computational Problems Some computational problems are hard Despite a numerous attempts we do not know any efficient.
Petrie maps and Petrie configurations Jurij Kovič, University of Primorska, Slovenia EuroGIGA Final Conference Berlin, February 20, 2014.
CSCI 3160 Design and Analysis of Algorithms Chengyu Lin.
Memory Allocation of Multi programming using Permutation Graph By Bhavani Duggineni.
V Spanning Trees Spanning Trees v Minimum Spanning Trees Minimum Spanning Trees v Kruskal’s Algorithm v Example Example v Planar Graphs Planar Graphs v.
Center for Graphics and Geometric Computing, Technion 1 Computational Geometry Chapter 8 Arrangements and Duality.
Paradigms for Graph Drawing Graph Drawing: Algorithms for the Visualization of Graphs - Chapter 2 Presented by Liana Diesendruck.
Data Structures & Algorithms Graphs
CSE 589 Part VI. Reading Skiena, Sections 5.5 and 6.8 CLR, chapter 37.
MAT 2720 Discrete Mathematics Section 8.7 Planar Graphs
1 12/2/2015 MATH 224 – Discrete Mathematics Formally a graph is just a collection of unordered or ordered pairs, where for example, if {a,b} G if a, b.
Beyond planarity of graphs Eyal Ackerman University of Haifa and Oranim College.
1/29/15CMPS 3130/6130 Computational Geometry1 CMPS 3130/6130 Computational Geometry Spring 2015 Triangulations and Guarding Art Galleries Carola Wenk.
Spectral Partitioning: One way to slice a problem in half C B A.
© The McGraw-Hill Companies, Inc., Chapter 1 Introduction.
Center for Graphics and Geometric Computing, Technion 1 Computational Geometry Chapter 9 Line Arrangements.
1 CS270 Project Overview Maximum Planar Subgraph Danyel Fisher Jason Hong Greg Lawrence Jimmy Lin.
CCCG 2014 August 11, 2014 Department of Computer Science University of Manitoba Stephane Durocher Debajyoti Mondal.
The NP class. NP-completeness Lecture2. The NP-class The NP class is a class that contains all the problems that can be decided by a Non-Deterministic.
Proof of correctness of Dijkstra’s algorithm: Basically, we need to prove two claims. (1)Let S be the set of vertices for which the shortest path from.
Hongyu Liang Institute for Theoretical Computer Science Tsinghua University, Beijing, China The Algorithmic Complexity.
Algorithms and Networks
Graph Drawing.
Great Ideas: Algorithm Implementation
Graphs.
SPQR Tree.
MAT 2720 Discrete Mathematics
Computational Geometry
Presentation transcript:

The Rectilinear Symmetric Crossing Minimization Problem Seokhee Hong The University of Sydney

1. Introduction Graph drawing algorithm aims to construct geometric representations of graphs in 2D and 3D. A - B, C, D B - A, C, D C - A, B, D, E D - A, B, C, E E - C, D The input is a graph with no geometry AB D C E The output is a drawing of the graph; the drawing should be easy to understand, easy to remember, beautiful.

Aesthetics in Graph Drawing NP-hardness minimize edge crossings minimize area maximize symmetry minimize total edge length minimize number of bends angular resolution aspect ratio …… Conflict Minimize edge crossings Maximize symmetry

To construct symmetric drawings of graphs, we need to solve two problems. problem 1. find symmetry in graphs. symmetry finding algorithm problem 2. display the symmetry in a drawing. symmetric drawing algorithm This talk: we want to construct a straight-line drawing which displays given symmetries with minimum number of edge crossings. Symmetric Graph Drawing

Types of Symmetric Drawing in 2D Types of symmetry in 2D 1.Rotation 2.Reflection Types of symmetric drawing in 2D 1.Cyclic group of size k: k rotations 2.Dihedral group of size 2k: k rotations and k reflections 3.One reflection

Example: The Peterson Graph dihedral group(size 10) 5 rotations 5 reflections 5 edge crossings dihedral group(size 6) 3 rotations 3 reflections 3 edge crossings 1 reflection 2 crossings

The Crossing Minimization Problem A great deal of literature Mathematicians: Crossing number [Pach] Graph Drawers : Two layer crossing minimization [the book] [Buchheim & Hong 02]: crossing minimization for given symmetries with curve The Symmetric Crossing Minimization Problem

8 An automorphism of a graph G is a permutation of the vertex set which preserves adjacency. –Automorphism problem: isomorphism-complete 2. Background [Eades & Lin 00] geometric automorphism is an automorphism which can be displayed as a symmetry of a drawing D of G. –Geometric automorphism problem: NP-complete (12)(5)(34) (123)(45)

9 Geometric Automorphism Group [Eades & Lin 00] a group of geometric automorphisms which can be displayed as symmetries of a single drawing D of G (1234) (123)(4) Symmetry finding step: find geometric automorphism group of G with maximum size

Symmetry Finding Algorithm General graph NP-hard Heuristics Exact algorithm: ILP Exact algorithm: MAGMA [Manning 90] [Lipton,North,Sandberg85] [de Fraysseix 99] [Buchheim, Junger 01] [Abelson,Hong,Taylor02] [Manning, Atallah 88] [Manning, Atallah 92] [Manning 90] [Hong, Eades, Lee 98] [Hong, Eades 01] Planar graph Tree Outerplanar graph Plane graph Series parallel digraph Planar graph triconnected planar graph 2D2D 3D3D [Hong, Eades 00] [Hong01] [Abelson, Hong, Taylor 02] N/A [Hong, McKay,Eades02]

Step1: symmetry finding algorithm –orbit: partition of vertex set V under the geometric automorphism group –For each vertex v, the orbit of v under the group H is the set { u  V: u = p(v) for some p  H}. Step 2: drawing algorithm: [Eades & Lin 00] –draw each orbit in a concentric circle different drawings depending on the order of orbits Output of [Abelson, Hong, Taylor 02] O1: {1} O2: {2,3,4,5} O3: {6,7,8,9}

Dodecahedron: dihedral 2D

4-cube: cyclic 2D

Fourcell: dihedral 2D |V| = 120, |E| = 1440

PSP44: cyclic 2D |V|=85, |E|=1700

[Buchheim and Hong02] Symmetric Crossing Minimization Problem (SCM) Input: A graph G, and a geometric automorphism p. Output: A drawing of G which displays p with the minimum number of edge crossings. [Theorem] The problem SCM is NP-hard. Symmetric Crossing Minimization Problem

3. Rectilinear Symmetric Crossing Minimization Rectilinear Symmetric Crossing Minimization Problem: (REC-SCM) Input: A graph G, and a geometric automorphism group H. Output: A straight-line drawing of G which displays H with the minimum number of edge crossings. [Theorem] The problem REC-SCM is NP-hard. We divide into three cases.

Cyclic Rectilinear Symmetric Crossing Minimization Problem: REC-SCM-Cyclic Input: A graph G and a cyclic geometric automorphism group C. Output: A straight-line drawing of G which displays C with the minimum number of edge crossings. Dihedral Rectilinear Symmetric Crossing Minimization Problem: REC-SCM-Dihedral Input: A graph G and a dihedral geometric automorphism group D. Output: A straight-line drawing of G which displays D with the minimum number of edge crossings.

Axial Rectilinear Symmetric Crossing Minimization Problem: REC-SCM-Axial Input: A graph G and an axial geometric automorphism group A. Output: A straight-line drawing of G which displays A with the minimum number of edge crossings.

[Theorem] The problems REC-SCM-Cyclic, REC-SCM- Dihedral and REC-SCM-Axial are NP-hard. reduce the rectilinear crossing number problem, which is NP-hard[Bienstock93] to REC-SCM problem. use the similar argument from [Buchheim & Hong02]. main idea: define a function using disconnected isomorphic graphs. G

SCM : REC-SCM symmetric crossing number SCR(G,H): the smallest number of the edge crossings of a drawing of the graph G which displays the geometric automorphism group H. rectilinear symmetric crossing number REC-SCR(G,H): the smallest number of the edge crossings of a straight line drawing of the graph G which displays the geometric automorphism group H. [Lemma] SCR(G,H)  REC-SCR(G,H)

Example: SCR(K 6,H)  REC-SCR(K 6,H) Two symmetric drawings of K 6 displaying a dihedral group H of size 12. SCR(K 6, H) = 9 REC-SCR(K 6,H) = 15

The Orbit Graphs intra-orbit edge: if e connects two vertices in the same orbit. inter-orbit edge: if e connects two vertices in two different orbits. The orbit graph G_H of G under H: a graph whose vertices represent each orbit and edges represent the set of inter-orbit edges ,7,8,9 2,3,4,5 1

Choosing a Representation consider a graph with a single orbit. different drawings displaying a given geometric automorphism group H, depending on the choice of the representation. example: H = = p p2p2 p3p3 p4p4

More than Two Orbits different drawings displaying a given geometric automorphism group H, depending on the ordering of orbits. example: two drawings displaying dihedral group of size 10 5 crossings10 crossings

Heuristics for REC-SCM the main task: to decide the ordering of orbits to minimize edge crossings. The REC-SCM problem is geometric, rather than combinatorial, in contrast to the SCM problem.

10 crossings15 crossings Example : the radius makes a difference for REC-SCM.

4. Work in Progress SCM problem: evaluation of the general framework for SCM of [Buchheim and Hong 02] REC-SCM problem: –design and implement good heuristics (approximation algorithms) to compute the ordering of the orbit graph. –variations of heuristics for the minimum linear arrangement problem –variations of two layer crossing minimization methods –soft computing method: simulated annealing

Preliminary results Preliminary results showed that for the REC-SCM problem, simple heuristics perform fairly well for reasonably-sized graphs. – the size of the orbit graph is relatively small compare to the size of the graph G. Observations: –there is a trade off between the quality and the run time in general. –For dense graphs, the resulting drawings do not appear different to human eyes. –For sparse graphs, it is easier to compare the result instantly.

Future Work So far, we mainly focused on displaying the cyclic group. Further work includes the axial case and the dihedral case. However, this looks challenging, because of the existence of edges that are fixed by the axial symmetry.

5. Open Problems Find a tight lower bound of the SCR and REC-SCR: –Intuitively, a drawing that displays a larger geometric automorphism group needs more crossings. Investigate the relationship between the crossing numbers such as CR, SCR, REC-CR, REC-SCR: –CR(G)  REC-CR(G) –SCR(G,H)  REC-SCR(G,H) –CR(G)  SCR(G,H) : CR(G) = SCR(G,H), where H is a trivial automorphism group –REC-CR(G)  REC-SCR(G,H)

5. Open Problems Compute the REC-SCR for K n displaying k symmetries: –If H is a dihedral group of size 2n (i.e. maximum size geometric automorphism group), then there are n(n-1)(n-2)(n-3)/24 edge crossings. –What if we display fewer symmetries?