AbstractWe show that for graphs of bounded degree, a minimal elimination ordering can be determined in time a time bound of O(nα(n)) where α is the inverse Ackermann function. In particular, the time bound is O(n(Δ3+α(n))). Here Δ is the maximum degree of the input graph
AbstractKumar and Madhavan [Minimal vertex separators of chordal graphs, Discrete Appl. Math. 89 (19...
This paper presents an algorithm for finding parallel elimination orderings for Gaussian elimination...
AbstractTotal graphs of trees were proved strongly chordal by Martin Farber. We give a new proof of ...
We present an alternative linear time algorithm that computes an ordering that produces a fill-in th...
AbstractWe design the first efficient parallel algorithm for computing the minimal elimination order...
When minimum orderings proved too difficult to deal with, Rose, Tarjan, and Leuker instead studied m...
AbstractFor an arbitrary filled graph G+ of a given original graph G, we consider the problem of rem...
AbstractIn this paper a general theory of the elimination process (vertex elimination on a graph) is...
International audienceElimination Game is a well known algorithm that simulates Gaussian elimination...
We show that a minimum fill-in ordering of a graph can be determined in linear time if it can be mod...
International audienceFor every connected graph G, a subgraph H of G is isometric if the distance be...
AbstractElimination Game is a well-known algorithm that simulates Gaussian elimination of matrices o...
We study the graph parameter elimination distance to bounded degree, which was introduced by Bulian ...
We consider the following problem, called Relative Minimal Elimination Ordering. Given a graph G=(V,...
Abstract. Minimal elimination orderings were introduced by Rose, Tarjan, and Lueker in 1976, and dur...
AbstractKumar and Madhavan [Minimal vertex separators of chordal graphs, Discrete Appl. Math. 89 (19...
This paper presents an algorithm for finding parallel elimination orderings for Gaussian elimination...
AbstractTotal graphs of trees were proved strongly chordal by Martin Farber. We give a new proof of ...
We present an alternative linear time algorithm that computes an ordering that produces a fill-in th...
AbstractWe design the first efficient parallel algorithm for computing the minimal elimination order...
When minimum orderings proved too difficult to deal with, Rose, Tarjan, and Leuker instead studied m...
AbstractFor an arbitrary filled graph G+ of a given original graph G, we consider the problem of rem...
AbstractIn this paper a general theory of the elimination process (vertex elimination on a graph) is...
International audienceElimination Game is a well known algorithm that simulates Gaussian elimination...
We show that a minimum fill-in ordering of a graph can be determined in linear time if it can be mod...
International audienceFor every connected graph G, a subgraph H of G is isometric if the distance be...
AbstractElimination Game is a well-known algorithm that simulates Gaussian elimination of matrices o...
We study the graph parameter elimination distance to bounded degree, which was introduced by Bulian ...
We consider the following problem, called Relative Minimal Elimination Ordering. Given a graph G=(V,...
Abstract. Minimal elimination orderings were introduced by Rose, Tarjan, and Lueker in 1976, and dur...
AbstractKumar and Madhavan [Minimal vertex separators of chordal graphs, Discrete Appl. Math. 89 (19...
This paper presents an algorithm for finding parallel elimination orderings for Gaussian elimination...
AbstractTotal graphs of trees were proved strongly chordal by Martin Farber. We give a new proof of ...
DOI
Add to ORKG