Results 161 to 170 of about 327 (176)
Some of the next articles are maybe not open access.

On Generating Strong Elimination Orderings of Strongly Chordal Graphs

1998
We present a conceptually simple algorithm to generate an ordering of the vertices of an undirected graph. The ordering generated turns out to be a strong elimination ordering if and only if the given graph is a strongly chordal graph. This algorithm makes use of maximum cardinality search and lexicographic breadth first search algorithms which are ...
N. Kalyana Rama Prasad   +1 more
openaire   +1 more source

Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs

2002
Chordal bipartite graphs are introduced to analyze nonsymmetric matrices, and form a large class of perfect graphs. There are several problems, which can be solved efficiently on the class using the characterization by the doubly lexical ordering ofthe bipartite adjacency matrix.
openaire   +1 more source

Dually and strongly chordal graphs

2021
Andreas Brandstädt   +1 more
openaire   +1 more source

Characterizing s-strongly chordal bipartite graphs

Utilitas Mathematica
<p>The strongly chordal graph literature has recently expanded to include the sequentially smaller classes of <span class="math inline">\(s\)</span>-strongly chordal graphs for <span class="math inline">\(s = 1, 2, 3,\ldots\)</span> (and the limiting class of majorly chordal graphs). These stronger classes preserve — while
openaire   +1 more source

Locally connected spanning trees in strongly chordal graphs and proper circular-arc graphs

Discrete Mathematics, 2007
Ching-Chi Lin   +2 more
exaly  

Regular vines with strongly chordal pattern of (conditional) independence

Computational Statistics and Data Analysis, 2022
exaly  

The clique-separator graph for chordal graphs

Discrete Applied Mathematics, 2009
Louis Ibarra
exaly  

Home - About - Disclaimer - Privacy