Results 31 to 40 of about 2,126 (197)
Jisuanji kexue yu tansuo, 2020 To improve the accuracy of camera target tracking, a multi-camera multi-target tracking method based on multi-hypothesis tracking (MHT) framework using hierarchical relation model of trajectory tree is proposed.
LIU Guanqun, LI Ting
doaj +1 more source
Discrete Mathematics & Theoretical Computer Science, 1997 We study the P_4-tidy graphs, a new class defined by Rusu [30] in order to illustrate the notion of P_4-domination in perfect graphs. This class strictly contains the P_4-extendible graphs and the P_4-lite graphs defined by Jamison & Olariu in [19] and ...
V. Giakoumakis, F. Roussel, H. Thuillier
doaj +1 more source
Independence of causal influence and clique tree propagation
International Journal of Approximate Reasoning, 1998 Appears in Proceedings of the Thirteenth Conference on Uncertainty in Artificial Intelligence (UAI1997)
Zhang, NL, Yan, L.
openaire +2 more sources
The Clique-Width of Minimal Series-Parallel Digraphs
AlgorithmsMSP DAGs (short for minimal series-parallel digraphs) can be defined from the single vertex graph by applying the parallel composition and series composition.
Frank Gurski, Ruzayn Quaddoura
doaj +1 more source
Scientific Reports, 2021 The urinary proteome is a promising pool of biomarkers of kidney disease. However, the protein changes observed in urine only partially reflect the deregulated mechanisms within kidney tissue.
Franck Boizard +5 more
doaj +1 more source
A superclass of Edge-Path-Tree graphs with few cliques [PDF]
Operations Research Letters, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
CARAMIA, MASSIMILIANO, Apollonio, N.
openaire +5 more sources
End Simplicial Vertices in Path Graphs
Discussiones Mathematicae Graph Theory, 2016 A graph is a path graph if there is a tree, called UV -model, whose vertices are the maximal cliques of the graph and for each vertex x of the graph the set of maximal cliques that contains it induces a path in the tree.
Gutierrez Marisa, Tondato Silvia B.
doaj +1 more source
On r-Noncommuting Graph of Finite Rings
Axioms, 2021 Let R be a finite ring and r∈R. The r-noncommuting graph of R, denoted by ΓRr, is a simple undirected graph whose vertex set is R and two vertices x and y are adjacent if and only if [x,y]≠r and [x,y]≠−r.
Rajat Kanti Nath +3 more
doaj +1 more source
Tree-width, clique-minors, and eigenvalues
Discrete Mathematics, 2004 Let \(G\) be a simple graph of order \(n\). Let \(\rho(G)\) be the spectral radius of \(G\) and let \(\lambda(G)\) be the least eigenvalue of \(G\). The author proves the following results: If \(G\) is \(K_5\) minor-free graph, then \(\rho(G) \leq 1 + \sqrt{3n - 8}\), where equality holds if and only if \(G\) is isomorphic to \(K_3 \nabla (n-3)K_1 ...
openaire +2 more sources
Boundary cliques, clique trees and perfect sequences of maximal cliques of a chordal graph
, 2006 We characterize clique trees of a chordal graph in their relation to simplicial vertices and perfect sequences of maximal cliques. We investigate boundary cliques defined by Shibata and clarify their relation to endpoints of clique trees. Next we define a symmetric binary relation between the set of clique trees and the set of perfect sequences of ...
Hara, Hisayuki, Takemura, Akimichi
openaire +2 more sources