Perfect Gaussian Elimination and Chordality By Shashank Rao.

Slides:



Advertisements
Similar presentations
CSE 211 Discrete Mathematics
Advertisements

Chapter 23 Minimum Spanning Tree
CS 253: Algorithms Chapter 22 Graphs Credit: Dr. George Bebis.
Graph-02.
Bayesian Networks, Winter Yoav Haimovitch & Ariel Raviv 1.
13 May 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Introduction.
 Graph Graph  Types of Graphs Types of Graphs  Data Structures to Store Graphs Data Structures to Store Graphs  Graph Definitions Graph Definitions.
Agenda: Problem statement Graph Construction Relation to graph problem Special Property Problem solution References.
Author: Jie chen and Yousef Saad IEEE transactions of knowledge and data engineering.
Solving Systems of Linear Equations Part Pivot a Matrix 2. Gaussian Elimination Method 3. Infinitely Many Solutions 4. Inconsistent System 5. Geometric.
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.
Chapter 9 Graph algorithms Lec 21 Dec 1, Sample Graph Problems Path problems. Connectedness problems. Spanning tree problems.
Discrete Structures Chapter 7A Graphs Nurul Amelina Nasharuddin Multimedia Department.
Additive Spanners for k-Chordal Graphs V. D. Chepoi, F.F. Dragan, C. Yan University Aix-Marseille II, France Kent State University, Ohio, USA.
ARCHEOLOGICAL SERIATION AND INTERVAL GRAPHS
9.3 Representing Graphs and Graph Isomorphism
CS 290H Lecture 17 Dulmage-Mendelsohn Theory
HAWKES LEARNING SYSTEMS math courseware specialists Copyright © 2011 Hawkes Learning Systems. All rights reserved. Hawkes Learning Systems College Algebra.
9.2 Graph Terminology and Special Types Graphs
GRAPH Learning Outcomes Students should be able to:
1 A fast algorithm for Maximum Subset Matching Noga Alon & Raphael Yuster.
MAPS OF DNA AND INTERVAL GRAPHS by Akshita Gurram.
MCA 520: Graph Theory Instructor Neelima Gupta
Symbolic sparse Gaussian elimination: A = LU
GRAPHS CSE, POSTECH. Chapter 16 covers the following topics Graph terminology: vertex, edge, adjacent, incident, degree, cycle, path, connected component,
A Clustering Algorithm based on Graph Connectivity Balakrishna Thiagarajan Computer Science and Engineering State University of New York at Buffalo.
ساختمانهای گسسته دانشگاه صنعتی شاهرود – فروردین 1392.
Based on slides by Y. Peng University of Maryland
Data Structures & Algorithms Graphs
Graph Partitions. Partition V(G) into k sets (k=3)  Vertex partitions.
Solution of Sparse Linear Systems
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)
7. Basic Operations on Graphs
September1999 CMSC 203 / 0201 Fall 2002 Week #13 – 18/20/22 November 2002 Prof. Marie desJardins.
Graphs A graphs is an abstract representation of a set of objects, called vertices or nodes, where some pairs of the objects are connected by links, called.
GRAPHS. Graph Graph terminology: vertex, edge, adjacent, incident, degree, cycle, path, connected component, spanning tree Types of graphs: undirected,
Basic Operations on Graphs Lecture 5.. Basic Operations on Graphs Deletion of edges Deletion of vertices Addition of edges Union Complement Join.
Interval Graph Test Wen-Lian Hsu.
Network Partition –Finding modules of the network. Graph Clustering –Partition graphs according to the connectivity. –Nodes within a cluster is highly.
Complexity 24-1 Complexity Andrei Bulatov Counting Problems.
Copyright © 1999 by the McGraw-Hill Companies, Inc. Barnett/Ziegler/Byleen College Algebra, 6 th Edition Chapter Six Systems of Equations & Inequalities.
1 GRAPH Learning Outcomes Students should be able to: Explain basic terminology of a graph Identify Euler and Hamiltonian cycle Represent graphs using.
Lecture 20. Graphs and network models 1. Recap Binary search tree is a special binary tree which is designed to make the search of elements or keys in.
An introduction to chordal graphs and clique trees
Applied Discrete Mathematics Week 14: Trees
Chapter 9 (Part 2): Graphs
Applied Discrete Mathematics Week 13: Graphs
Special Graphs By: Sandeep Tuli Astt. Prof. CSE.
Representing Relations
PC trees and Circular One Arrangements
Systems of Linear Equations
CS200: Algorithm Analysis
Based on slides by Y. Peng University of Maryland
ICS 353: Design and Analysis of Algorithms
CS100: Discrete structures
Graph Operations And Representation
Walks, Paths, and Circuits
MATRICES MATRIX OPERATIONS.
On (k,l)-Leaf Powers Peter Wagner University of Rostock, Germany
RECORD. RECORD COLLABORATE: Discuss: Is the statement below correct? Try a 2x2 example.
Systems of distinct representations
Graphs G = (V, E) V are the vertices; E are the edges.
Ch09 _2 Approximation algorithm
Matrices and Determinants
Applied Discrete Mathematics Week 13: Graphs
Based on slides by Y. Peng University of Maryland
Agenda Review Lecture Content: Shortest Path Algorithm
Perfect Phylogeny Tutorial #10
Nonsymmetric Gaussian elimination
For Friday Read chapter 9, sections 2-3 No homework
Presentation transcript:

Perfect Gaussian Elimination and Chordality By Shashank Rao

 Contents  Problem statement  Construction of graph  R-W problem leading to graph problem  Bipartite graphs  Perfect elimination bipartite graphs  Simplicial edges  Solution  Chordality  Special properties

 Problem Statement  When performing Gaussian elimination on sparse matrices an arbitrary choice of pivots may result in the unfortunate side effect of turning zeros to non zero values, which may possibly even lead to dense matrix.

 Construction Of Graph  An instance of the problem can be represented by a {0, 1} matrix M where Mi,j = 1 denotes that the original matrix contains a non-zero value at element (i, j).  We can construct the bipartite graph G[M] with vertices corresponding to the rows and columns in M where vertices i and j are adjacent iff Mi,j is nonzero

 Cont…  For example the matrix (a) has the corresponding bipartite graph (b)

 Graph Problem To show that a bipartite graph is a perfect elimination bipartite graph. If it is a perfect elimination bipartite graph then how to find its perfect edge elimination scheme.

 Bipartite Graphs A bipartite graph is an undirected graph whose vertices can be partitioned into disjoint sets X and Y such that every edge has one vertex in X and the other in Y.

 Perfect Elimination Bipartite Graphs

 Simplicial Edges An edge xy is called simplicial if Adj (x) U Adj(y) induces a complete bipartite subgraph. For the following bipartite graph (b) the simplicial edges are represented in bold lines.

Example: For example the following graph has the perfect elimination ordering [x1y1,x2y2,x3y3,x4y4]

 Solution We repeatedly find a simplicial edge of a bipartite graph and delete all the edges adjacent to it.If we succeed in eliminating all edges, then the bipartite graph was perfect elimination. Such procedure can be implemented to run in a polynomial time.

 Chordal Bipartite graphs A bipartite graph is called chordal bipartite if every cycle of length greater than 4 has a cord.

 Special Properties Every chordal bipartite graph is a perfect elimination bipartite graph. Chordal bipartite graphs give a characterization of the matrices in an important class of linear programming problems for which the greedy heuristic approach gives an optimum solution.

 Cont.. It is found that removal of simplicial edge from a chordal bipartite graph produces a chordal bipartite graph. As consequence occurrence of arithmetic zeros will not terminate perfect Gaussian elimination on sparse matrices having associated a chordal bipartite graph.

 References M. C. Golumbic, A note o n perfect Gaussian elimination Fall2014/Lecture4.pdfhttp:// Fall2014/Lecture4.pdf 5. urnals/DAM_BomhoffManthey_Bisimplicial.pdf

THANKS! QUESTIONS?