A Clique Tree Algorithm for Partitioning a Chordal Graph into Transitive Subgraphs
نویسندگان
چکیده
A partitioning problem on chordal graphs that arises in the solution of sparse triangular systems of equations on parallel computers is considered Roughly the problem is to partition a chordal graph G into the fewest transitively orientable subgraphs over all perfect elimination orderings of G subject to a certain precedence relationship on its vertices In earlier work a greedy scheme that solved the problem by eliminating a largest subset of vertices at each step was described and an algorithm implementing the scheme in time and space linear in the number of edges of the graph was provided Here a more e cient greedy scheme obtained by representing the chordal graph in terms of its maximal cliques which eliminates a subset of the leaf cliques at each step is described Several new results about minimal vertex separators in chordal graphs and in particular the concept of a critical separator of a leaf clique are employed to prove that the new scheme solves the partitioning problem We provide an algorithm implementing the scheme in time and space linear in the size of the clique tree AMS MOS subject classi cations primary F F R
منابع مشابه
Partitioning A Chordal Graph Into Transitive Subgraphs For Parallel Sparse Triangular Solution
متن کامل
Clique graph representations of ptolemaic graphs
A graph is ptolemaic if and only if it is both chordal and distancehereditary. Thus, a ptolemaic graph G has two kinds of intersection graph representations: one from being chordal, and the other from being distance-hereditary. The first of these, called a clique tree representation, is easily generated from the clique graph of G (the intersection graph of the maximal complete subgraphs of G). ...
متن کاملPerfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کاملPolyhedral Computations for the Simple Graph Partitioning Problem
The simple graph partitioning problem is to partition an edge-weighted graph into mutually disjoint subgraphs, each containing no more than b nodes, such that the sum of the weights of all edges in the subgraphs is maximal. In this paper we present a branch-and-cut algorithm for the problem that uses several classes of facet-defining inequalities as cuttingplanes. These are b-tree, clique, cycl...
متن کاملChordal Graphs and Their Clique Graphs
In the rst part of this paper, a new structure for chordal graph is introduced, namely the clique graph. This structure is shown to be optimal with regard to the set of clique trees. The greedy aspect of the recognition algorithms of chordal graphs is studied. A new greedy algorithm that generalizes both Maximal cardinality Search (MCS) and Lexicographic Breadth rst search is presented. The tra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002