Results 1  10
of
1,477,211
Moplex Elimination Orderings
 First CologneTwente Workshop on Graphs
, 2001
"... Classically, triangulated graphs are characterized and recognized by way of perfect elimination orderings (peo, which correspond to an elimination scheme on simplicial vertices). Algorithm LexBFS computes such a peo eciently, but is also useful for the enumeration of the minimal separators and maxim ..."
Abstract

Cited by 7 (5 self)
 Add to MetaCart
Classically, triangulated graphs are characterized and recognized by way of perfect elimination orderings (peo, which correspond to an elimination scheme on simplicial vertices). Algorithm LexBFS computes such a peo eciently, but is also useful for the enumeration of the minimal separators
Oracles for vertex elimination orderings
, 2005
"... By maintaining appropriate data structures, we develop constanttime transposition oracles that answer whether or not two adjacent vertices in a simple elimination ordering (SEO) or a semiperfect elimination ordering (semiPEO) can be swapped to produce a new SEO or semiPEO, respectively. Combined wi ..."
Abstract
 Add to MetaCart
By maintaining appropriate data structures, we develop constanttime transposition oracles that answer whether or not two adjacent vertices in a simple elimination ordering (SEO) or a semiperfect elimination ordering (semiPEO) can be swapped to produce a new SEO or semiPEO, respectively. Combined
Simple and Efficient Modifications of Elimination Orderings
"... Abstract One of the most important and well studied problems related to sparse Cholesky factorization is to compute elimination orderings that give as few nonzero entries as possible in the resulting factors. We study the problem of modifying a given elimination ordering through local reorderings. W ..."
Abstract
 Add to MetaCart
Abstract One of the most important and well studied problems related to sparse Cholesky factorization is to compute elimination orderings that give as few nonzero entries as possible in the resulting factors. We study the problem of modifying a given elimination ordering through local reorderings
An Approximate Minimal Elimination Ordering Scheme
"... factorization Abstract. Matrix ordering is a key technique when applying Cholesky factorization method to solving sparse symmetric positive definite system Ax = b. In view of some known minimal elimination ordering methods, an efficient heuristic approximate minimal elimination ordering scheme is pr ..."
Abstract
 Add to MetaCart
factorization Abstract. Matrix ordering is a key technique when applying Cholesky factorization method to solving sparse symmetric positive definite system Ax = b. In view of some known minimal elimination ordering methods, an efficient heuristic approximate minimal elimination ordering scheme
The Parallel Complexity of Elimination Ordering Procedures
 In Workshop on GraphTheoretic Concepts in Computer Science
, 1993
"... We prove that lexicographic breadthfirst search is Pcomplete and that a variant of the parallel perfect elimination procedure of P. Klein [24] is powerful enough to compute a semiperfect elimination ordering in sense of [23] if certain induced subgraphs are forbidden. We present an efficient para ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We prove that lexicographic breadthfirst search is Pcomplete and that a variant of the parallel perfect elimination procedure of P. Klein [24] is powerful enough to compute a semiperfect elimination ordering in sense of [23] if certain induced subgraphs are forbidden. We present an efficient
Parallelizing Elimination Orders with Linear Fill
, 1997
"... This paper presents an algorithm for finding parallel elimination orders for Gaussian elimination. Viewing a system of equations as a graph, the algorithm can be applied directly to interval graphs and chordal graphs. For general graphs, the algorithm can be used to parallelize the order produced by ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
This paper presents an algorithm for finding parallel elimination orders for Gaussian elimination. Viewing a system of equations as a graph, the algorithm can be applied directly to interval graphs and chordal graphs. For general graphs, the algorithm can be used to parallelize the order produced
Minimal Elimination Ordering for Graphs of Bounded Degree
, 1999
"... We show that for graphs of bounded degree, a subset minimal elimination ordering can be determined in almost linear time. ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We show that for graphs of bounded degree, a subset minimal elimination ordering can be determined in almost linear time.
From a simple elimination ordering to a strong elimination ordering in linear time
 INFORMATION PROCESSING LETTERS
, 2003
"... We present a linear time algorithm for transforming a simple elimination ordering of a strongly chordal graph into a strong elimination ordering. ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We present a linear time algorithm for transforming a simple elimination ordering of a strongly chordal graph into a strong elimination ordering.
Parallelizing and Deparallelizing Elimination Orders
, 1998
"... interval graphs, graph theory The order in which the variables of a linear system are processed determines the total amounts of fill and work to perform LU decomposition on the system. We identify a tradeoff between the amounts of fill and work for a given order and the parallelism inherent in that ..."
Abstract
 Add to MetaCart
interval graphs, graph theory The order in which the variables of a linear system are processed determines the total amounts of fill and work to perform LU decomposition on the system. We identify a tradeoff between the amounts of fill and work for a given order and the parallelism inherent
PostProcessing Elimination Orderings to Reduce Induced Width
, 2009
"... The induced width along an elimination ordering is an important factor in the space and time complexity of many inference algorithms for graphical models. Indeed, slight changes in induced width can sometimes dictate ..."
Abstract
 Add to MetaCart
The induced width along an elimination ordering is an important factor in the space and time complexity of many inference algorithms for graphical models. Indeed, slight changes in induced width can sometimes dictate
Results 1  10
of
1,477,211