Results 131 to 140 of about 28,286 (155)
Some of the next articles are maybe not open access.
Computing the Clique-Width of Polygonal Tree Graphs
2017Similar 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
2005In 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
Integrative oncology: Addressing the global challenges of cancer prevention and treatment
Ca-A Cancer Journal for Clinicians, 2022Jun J Mao,, Msce +2 more
exaly
A clique tree algorithm exploiting context specific independence
2009Context 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
Multidisciplinary standards of care and recent progress in pancreatic ductal adenocarcinoma
Ca-A Cancer Journal for Clinicians, 2020Aaron J Grossberg +2 more
exaly
Oral complications of cancer and cancer therapy
Ca-A Cancer Journal for Clinicians, 2012Joel B Epstein +2 more
exaly
American Cancer Society Head and Neck Cancer Survivorship Care Guideline
Ca-A Cancer Journal for Clinicians, 2016Nader Sadeghi +2 more
exaly