Hagen-Kahng EIG Partitioning

Slides:



Advertisements
Similar presentations
Connectivity - Menger’s Theorem Graphs & Algorithms Lecture 3.
Advertisements

Instructor Neelima Gupta Table of Contents Approximation Algorithms.
Modularity and community structure in networks
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.
Clustering II CMPUT 466/551 Nilanjan Ray. Mean-shift Clustering Will show slides from:
Foreground/Background Image Segmentation. What is our goal? To label each pixel in an image as belonging to either the foreground of the scene or the.
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.
Introduction to Approximation Algorithms Lecture 12: Mar 1.
CS 584. Review n Systems of equations and finite element methods are related.
Hierarchical Region-Based Segmentation by Ratio-Contour Jun Wang April 28, 2004 Course Project of CSCE 790.
Balanced Graph Partitioning Konstantin Andreev Harald Räcke.
Several Graph Layout Problems for Grids Vladimir Lipets Ben-Gurion University of the Negev Advisors: Prof. Daniel Berend Prof. Ephraim Korach.
MRF Labeling With Graph Cut CMPUT 615 Nilanjan Ray.
1 Combinatorial Dominance Analysis Keywords: Combinatorial Optimization (CO) Approximation Algorithms (AA) Approximation Ratio (a.r) Combinatorial Dominance.
Graph-Cut Algorithm with Application to Computer Vision Presented by Yongsub Lim Applied Algorithm Laboratory.
K-Coloring k-coloring: A k-coloring of a graph G is a labeling f: V(G)  S, where |S|=k. The labels are colors; the vertices of one color form a color.
Multilevel Graph Partitioning and Fiduccia-Mattheyses
1 CSC 6001 VLSI CAD (Physical Design) January
Coordinate Graphing System of Linear Inequalities.
Graph partition in PCB and VLSI physical synthesis Lin Zhong ELEC424, Fall 2010.
GRAPH Learning Outcomes Students should be able to:
Graph Partitioning Donald Nguyen October 24, 2011.
CS774. Markov Random Field : Theory and Application Lecture 08 Kyomin Jung KAIST Sep
Notes Over 2.6 Checking Solutions of Inequalities Check whether the given ordered pairs are solutions of the inequality.
EXAMPLE 3 Find the inverse of a 3 × 3 matrix Use a graphing calculator to find the inverse of A. Then use the calculator to verify your result. 2 1 – 2.
Spectral graph theory Network & Matrix Computations CS NMC David F. Gleich.
1 Closures of Relations: Transitive Closure and Partitions Sections 8.4 and 8.5.
Spectral Analysis based on the Adjacency Matrix of Network Data Leting Wu Fall 2009.
Lecture 7 All-Pairs Shortest Paths. All-Pairs Shortest Paths.
1/24 Introduction to Graphs. 2/24 Graph Definition Graph : consists of vertices and edges. Each edge must start and end at a vertex. Graph G = (V, E)
1 Some Inequalities on Weighted Vertex Degrees, Eigenvalues, and Laplacian Eigenvalues of Weighted Graphs Behzad Torkian Dept. of Mathematical Sciences.
CAS 721 Course Project Minimum Weighted Clique Cover of Test Set By Wei He ( )
When Affinity Meets Resistance On the Topological Centrality of Edges in Complex Networks Gyan Ranjan University of Minnesota, MN [Collaborators: Zhi-Li.
Spectral Partitioning: One way to slice a problem in half C B A.
Efficient Semi-supervised Spectral Co-clustering with Constraints
Lecture 19 Minimal Spanning Trees CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
PowerGraph: Distributed Graph- Parallel Computation on Natural Graphs Joseph E. Gonzalez, Yucheng Low, Haijie Gu, and Danny Bickson, Carnegie Mellon University;
Spectral Clustering Shannon Quinn (with thanks to William Cohen of Carnegie Mellon University, and J. Leskovec, A. Rajaraman, and J. Ullman of Stanford.
A Tutorial on Spectral Clustering Ulrike von Luxburg Max Planck Institute for Biological Cybernetics Statistics and Computing, Dec. 2007, Vol. 17, No.
EXAMPLE 1 Graph simple inequalities a. Graph x < 2.
Lecture 5 Graph Theory prepped by Lecturer ahmed AL tememe 1.
Computation on Graphs. Graphs and Sparse Matrices Sparse matrix is a representation of.
Mincut Placement (1/12)Practical Problems in VLSI Physical Design Mincut Placement Perform quadrature mincut onto 4 × 4 grid  Start with vertical cut.
Great Theoretical Ideas In Computer Science
Graph Representations
Gyan Ranjan University of Minnesota, MN
Rajaraman-Wong Algorithm
The Road Problem - Special Case Study
FlowMap Algorithm Perform clustering on the following 2-bounded network Intra-cluster and node delay = 0, inter-cluster = 1 Pin constraint = 3 Practical.
CS200: Algorithm Analysis
Lecture 16 Cramer’s Rule, Eigenvalue and Eigenvector
Sequence Pair Representation
Lecture 7 All-Pairs Shortest Paths
Subhash Khot Theory Group
Grouping.
Iterative Deletion Routing Algorithm
GORDIAN Placement Perform GORDIAN placement
Structural balance.
Solution Solution Checking Solutions of Inequalities
CS100: Discrete structures
Multi-level Coarsening Algorithm
Approximating the Community Structure of the Long Tail
geometric representations of graphs
GreedyMaxCut a b w c d e 1.
Walks, Paths, and Circuits
Problem Solving 4.
3.3 Network-Centric Community Detection
Graphs G = (V, E) V are the vertices; E are the edges.
GRAPHS G=<V,E> Adjacent vertices Undirected graph
Spectral clustering methods
Presentation transcript:

Hagen-Kahng EIG Partitioning Perform EIG partitioning and minimize ratio cut cost. Clique-based graph model: dotted edge has weight of 0.5, and solid edge with no label has weight of 0.25. Practical Problems in VLSI Physical Design

Adjacency Matrix Practical Problems in VLSI Physical Design

Degree Matrix Practical Problems in VLSI Physical Design

Laplacian Matrix We obtain Q = D − A Practical Problems in VLSI Physical Design

Eigenvalue/vector Computation Practical Problems in VLSI Physical Design

EIG Partitioning Practical Problems in VLSI Physical Design

EIG Partitioning (cont) Practical Problems in VLSI Physical Design

EIG Partitioning (cont) Practical Problems in VLSI Physical Design

EIG Partitioning (cont) Practical Problems in VLSI Physical Design

Summary Good solution found: {(a,f,d,g,i), (j,b,h,e,c)} is well-balanced and has low RC cost. Practical Problems in VLSI Physical Design

Theorem Practical Problems in VLSI Physical Design