Several Graph Layout Problems for Grids Vladimir Lipets Ben-Gurion University of the Negev Advisors: Prof. Daniel Berend Prof. Ephraim Korach.

Slides:

Advertisements

Similar presentations

Orthogonal Drawing Kees Visser. Overview  Introduction  Orthogonal representation  Flow network  Bend optimal drawing.

Advertisements

Price Of Anarchy: Routing

Jump to first page DISTRIBUTED GENERATION OF PAIRWISE COMBINATIONS PARALLEL GRAPH PARTITIONING ON A HYPERCUBE F. Ercal, P. Sadayappan, and J. Ramanujan.

The Combinatorial Multigrid Solver Yiannis Koutis, Gary Miller Carnegie Mellon University TexPoint fonts used in EMF. Read the TexPoint manual before you.

Efficient Realization of Hypercube Algorithms on Optical Arrays* Hong Shen Department of Computing & Maths Manchester Metropolitan University, UK ( Joint.

Information Networks Graph Clustering Lecture 14.

Online Social Networks and Media. Graph partitioning The general problem – Input: a graph G=(V,E) edge (u,v) denotes similarity between u and v weighted.

Constructing Minimal Spanning Steiner Trees with Bounded Path Length Presenter : Cheng-Yin Wu, NTUGIEE Some of the Slides in this Presentation are Referenced.

Graph Laplacian Regularization for Large-Scale Semidefinite Programming Kilian Weinberger et al. NIPS 2006 presented by Aggeliki Tsoli.

On the complexity of orthogonal compaction maurizio patrignani univ. rome III.

CPSC 689: Discrete Algorithms for Mobile and Wireless Systems Spring 2009 Prof. Jennifer Welch.

1 Representing Graphs. 2 Adjacency Matrix Suppose we have a graph G with n nodes. The adjacency matrix is the n x n matrix A=[a ij ] with: a ij = 1 if.

Graph Clustering. Why graph clustering is useful? Distance matrices are graphs  as useful as any other clustering Identification of communities in social.

Graph Clustering. Why graph clustering is useful? Distance matrices are graphs  as useful as any other clustering Identification of communities in social.

38 th Design Automation Conference, Las Vegas, June 19, 2001 Creating and Exploiting Flexibility in Steiner Trees Elaheh Bozorgzadeh, Ryan Kastner, Majid.

EDA (CS286.5b) Day 6 Partitioning: Spectral + MinCut.

1 Shira Zucker Ben-Gurion University of the Negev Advisors: Prof. Daniel Berend Prof. Ephraim Korach Anticoloring for Toroidal Grids.

High Performance Computing 1 Parallelization Strategies and Load Balancing Some material borrowed from lectures of J. Demmel, UC Berkeley.

SubSea: An Efficient Heuristic Algorithm for Subgraph Isomorphism Vladimir Lipets Ben-Gurion University of the Negev Joint work with Prof. Ehud Gudes.

2-Layer Crossing Minimisation Johan van Rooij. Overview Problem definitions NP-Hardness proof Heuristics & Performance Practical Computation One layer:

Integer Programming Difference from linear programming –Variables x i must take on integral values, not real values Lots of interesting problems can be.

1 Internet Networking Spring 2002 Tutorial 6 Network Cost of Minimum Spanning Tree.

W. D. Grover TRLabs & University of Alberta © Wayne D. Grover 2002, 2003 Graph theory and routing (initial background) E E Lecture 4.

Finding a maximum independent set in a sparse random graph Uriel Feige and Eran Ofek.

7/13/ EE4271 VLSI Design VLSI Routing. 2 7/13/2015 Routing Problem Routing to reduce the area.

Floorplanning. Obtained by subdividing a given rectangle into smaller rectangles. Each smaller rectangle corresponds to a module.

Prof. D. Zhou UT Dallas Analog Circuits Design Automation 1.

Complexity results for three-dimensional orthogonal graph drawing maurizio “titto” patrignani third university of rome graph drawing 2005.

Nirmalya Roy School of Electrical Engineering and Computer Science Washington State University Cpt S 223 – Advanced Data Structures Graph Algorithms: Minimum.

Term 2 Grade 11 Core Project The Polynomial Project Done by: Abdulla Mohammed Almuhiri & Mohammed Saeed Class :

June 21, 2007 Minimum Interference Channel Assignment in Multi-Radio Wireless Mesh Networks Anand Prabhu Subramanian, Himanshu Gupta.

Models and Algorithms for Complex Networks Graph Clustering and Network Communities.

New Modeling Techniques for the Global Routing Problem Anthony Vannelli Department of Electrical and Computer Engineering University of Waterloo Waterloo,

How to reform a terrain into a pyramid Takeshi Tokuyama (Tohoku U) Joint work with Jinhee Chun (Tohoku U) Naoki Katoh (Kyoto U) Danny Chen (U. Notre Dame)

Graph Algorithms. Definitions and Representation An undirected graph G is a pair (V,E), where V is a finite set of points called vertices and E is a finite.

Drawing Straight Line Graphs

Optimization of Wavelength Assignment for QoS Multicast in WDM Networks Xiao-Hua Jia, Ding-Zhu Du, Xiao-Dong Hu, Man-Kei Lee, and Jun Gu, IEEE TRANSACTIONS.

Energy-Efficient Sensor Network Design Subject to Complete Coverage and Discrimination Constraints Frank Y. S. Lin, P. L. Chiu IM, NTU SECON 2005 Presenter:

Routing Tree Construction with Buffer Insertion under Obstacle Constraints Ying Rao, Tianxiang Yang Fall 2002.

1 The Encoding Complexity of Network Coding Michael Langberg California Institute of Technology Joint work with Jehoshua Bruck and Alex Sprintson.

17 A – Cubic Polynomials 1: Graphing Basic Cubic Polynomials.

Confluent Drawings of Bipartite/Layered Graphs Ulrik, Riko, Stephen, Titto, Nina.

New algorithms for Disjoint Paths and Routing Problems

What Dynamic Programming (DP) is a fundamental problem solving technique that has been widely used for solving a broad range of search and optimization.

1) Find and label the degree of each vertex in the graph.

The geometric GMST problem with grid clustering Presented by 楊劭文, 游岳齊, 吳郁君, 林信仲, 萬高維 Department of Computer Science and Information Engineering, National.

A Binary Linear Programming Formulation of the Graph Edit Distance Presented by Shihao Ji Duke University Machine Learning Group July 17, 2006 Authors:

1 CS270 Project Overview Maximum Planar Subgraph Danyel Fisher Jason Hong Greg Lawrence Jimmy Lin.

Introduction Wireless Ad-Hoc Network  Set of transceivers communicating by radio.

Network Topology Single-level Diversity Coding System (DCS) An information source is encoded by a number of encoders. There are a number of decoders, each.

Laplacian Matrices of Graphs: Algorithms and Applications ICML, June 21, 2016 Daniel A. Spielman.

Great Theoretical Ideas In Computer Science

Anticoloring Problems on Graphs

Structural graph parameters Part 2: A hierarchy of parameters

Hagen-Kahng EIG Partitioning

Nuclear Norm Heuristic for Rank Minimization

Introduction Basic formulations Applications

Numerical Algorithms Quiz questions

Introduction Wireless Ad-Hoc Network

Walks, Paths, and Circuits

6.4 Volumes by Cross Sections

Problem Solving 4.

Bart M. P. Jansen Jesper Nederlof

A Graph Partitioning Algorithm by Node Separators

Numerical Computation and Optimization

Distance-preserving Subgraphs of Interval Graphs

Warm Up – Monday Calculate the Redundancy of the above network.

Drawing a graph

Presentation transcript:

Several Graph Layout Problems for Grids Vladimir Lipets Ben-Gurion University of the Negev Advisors: Prof. Daniel Berend Prof. Ephraim Korach

Graph layout problems A large number of theoretical and practical problems in various areas may be formulated as graph layout problems.

Graph layout problems

Graph layout problems (MINCUT)

Graph layout problems (Bisection)

Graph layout problems (Bandwidth)

Applications Such problems arise in connection with: VLSI circuit design, graph drawing, embedding problems, numerical analysis, optimization of networks for parallel computer architectures.

History Historically, bandwidth was the the first layout problem, as a means to speed up several computations on sparse matrices during the fifties. The bandwidth problem for graphs was first posed as an open problem during a graph theoretical meeting in 1967 by Harary. For more detailed survey of graph layout problems see. The Minimal Cutwidth Linear Arrangement problem (MINCUT) was first used in the seventies as a theoretical model for the number of channels in an optimal layout of a circuit [Adolphson and Hu 1973]

Known Results All above problems are NP-hard in general, MINCUT remains NP-hard even when restricted, for example, to polynomially (edge-) weighted trees planar graphs with maximum degree 3. MINCUT remains NP-hard even when restricted, for example, to trees, with maximum degree 3

Known Results (table)

Grids

Grids (example)

Toroidal Grids (example)

Location Matrix

Double Monotonic

Main Results

Main Lemma (non toroidal grids)

Our Approach

Our Approach (cont.)

Prof of lower bound

Constructions (upper bounds)

Main Lemma (toroidal grids)

Lower Bounds for square toroidal grids

Constructions (upper bounds) for square toroidal grids

Lower Bounds for rectangular toroidal grids

Constructions (upper bounds) for rectangular toroidal grids

The End