AbstractThis paper studies properties of perfect elimination orderings in chordal graphs. Specific connections to convex subsets and quasiconcave functions in a graph are discussed. Several new schemes for generating all perfect elimination orderings are investigated and related to existing schemes
Chordal graphs are undirected graphs in which every cycle of length at least four has a chord. They...
International audienceWe provide a general method to prove the existence and compute efficiently eli...
We consider the following problem, called Relative Minimal Elimination Ordering. Given a graph G=(V,...
AbstractThis paper studies properties of perfect elimination orderings in chordal graphs. Specific c...
AbstractAn important property of chordal graphs is that these graphs are characterized by the existe...
We develop a constant time transposition "oracle" for the set of perfect elimination orderings of ch...
AbstractWe develop a constant time transposition “oracle” for the set of perfect elimination orderin...
AbstractLet G = (V,E) be a finite undirected connected graph. We show that there is a common perfect...
AbstractWe re-consider perfect elimination digraphs, that were introduced by Haskins and Rose in 197...
Several efficient algorithms have been proposed to construct a perfect elimination ordering of the v...
We introduce a new class of structured symmetric matrices by extending the notion of perfect elimina...
We introduce a new class of structured symmetric matrices by extending the notion of perfect elimina...
AbstractSeveral efficient algorithms have been proposed to construct a perfect elimination ordering ...
Chordal graphs form an important and widely studied subclass of perfect graphs. The set of minimal v...
AbstractFor an undirected graph G the kth power Gk of G is the graph with the same vertex set as G w...
Chordal graphs are undirected graphs in which every cycle of length at least four has a chord. They...
International audienceWe provide a general method to prove the existence and compute efficiently eli...
We consider the following problem, called Relative Minimal Elimination Ordering. Given a graph G=(V,...
AbstractThis paper studies properties of perfect elimination orderings in chordal graphs. Specific c...
AbstractAn important property of chordal graphs is that these graphs are characterized by the existe...
We develop a constant time transposition "oracle" for the set of perfect elimination orderings of ch...
AbstractWe develop a constant time transposition “oracle” for the set of perfect elimination orderin...
AbstractLet G = (V,E) be a finite undirected connected graph. We show that there is a common perfect...
AbstractWe re-consider perfect elimination digraphs, that were introduced by Haskins and Rose in 197...
Several efficient algorithms have been proposed to construct a perfect elimination ordering of the v...
We introduce a new class of structured symmetric matrices by extending the notion of perfect elimina...
We introduce a new class of structured symmetric matrices by extending the notion of perfect elimina...
AbstractSeveral efficient algorithms have been proposed to construct a perfect elimination ordering ...
Chordal graphs form an important and widely studied subclass of perfect graphs. The set of minimal v...
AbstractFor an undirected graph G the kth power Gk of G is the graph with the same vertex set as G w...
Chordal graphs are undirected graphs in which every cycle of length at least four has a chord. They...
International audienceWe provide a general method to prove the existence and compute efficiently eli...
We consider the following problem, called Relative Minimal Elimination Ordering. Given a graph G=(V,...
DOI
Add to ORKG