Results 181 to 190 of about 453 (193)
Some of the next articles are maybe not open access.
Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs
2002Chordal 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
Sequential and parallel algorithms on compactly represented chordal and strongly chordal graphs
1997For a given ordered graph (G,
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
Characterizing and computing the structure of clique intersections in strongly chordal graphs
Discrete Applied Mathematics, 2015Ragnar Nevries
exaly
A simple linear time algorithm for the domatic partition problem on strongly chordal graphs
Information Processing Letters, 1992Maw-Shang Chang
exaly
Cycle Extendability and Hamiltonian Cycles in Chordal Graph Classes
SIAM Journal on Discrete Mathematics, 2006Atif Abueida, R Sritharan
exaly
Strongly chordal and chordal bipartite graphs are sandwich monotone
Journal of Combinatorial Optimization, 2010Pinar Heggernes +2 more
exaly