Results 171 to 180 of about 2,126 (197)
Some of the next articles are maybe not open access.

Cliques enumeration and tree-like resolution proofs

Information Processing Letters, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Efficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring on chordal graphs

Information Processing Letters, 1988
\textit{J. Naor}, \textit{M. Naor} and \textit{A. A. Schaffer} [Proc. 19th Ann. ACM Symp. Theory Comput., 355-364 (1987)] proposed parallel algorithms for several problems on chordal graphs such as computing maximal cliques, a minimum coloring, a perfect elimination scheme and so on.
Ho, Chinwen, Lee, Richard C. T.
openaire   +2 more sources

Computing the Clique-Width of Polygonal Tree Graphs

2017
Similar to the tree-width (twd), the clique-width (cwd) is an invariant of graphs. There is a well-known relationship between the tree-width and clique-width for any graph. The tree-width of a special class of graphs called polygonal trees is 2, so the clique-width for those graphs is smaller or equal than 6.
J. Leonardo González-Ruiz   +3 more
openaire   +1 more source

Computation of Chromatic Polynomials Using Triangulations and Clique Trees

2005
In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of G, the base case of the recursion being chordal graphs. The set of edges to be considered is taken from a triangulation of G.
Berthomé, Pascal   +2 more
openaire   +2 more sources

Sensitive protein alignments at tree-of-life scale using DIAMOND

Nature Methods, 2021
Benjamin Buchfink   +2 more
exaly  

A clique tree algorithm exploiting context specific independence

2009
Context specific independence can provide compact representation of the conditional probabilities in Bayesian networks when some variables are only relevant in specific contexts. We present eve-tree, an algorithm that exploits context specific independence in clique tree propagation.
openaire   +1 more source

Microbial diversity in extreme environments

Nature Reviews Microbiology, 2021
Wen-Sheng Shu, Li-Nan Huang
exaly  

Phylogenetic tree building in the genomic age

Nature Reviews Genetics, 2020
Paschalia Kapli   +2 more
exaly  

Tree diversity increases decadal forest soil carbon and nitrogen accrual

Nature, 2023
Xinli Chen   +2 more
exaly  

Home - About - Disclaimer - Privacy