Results 51 to 60 of about 28,286 (155)
GPU-Accelerated Clique Tree Propagation for Pouch Latent Tree Models [PDF]
, 2018 Pouch latent tree models (PLTMs) are a class of probabilistic graphical models that generalizes the Gaussian mixture models (GMMs). PLTMs produce multiple clusterings simultaneously and have been shown better than GMMs for cluster analysis in previous studies.
openaire +2 more sources
Computing a Clique Tree with the Algorithm Maximal Label Search [PDF]
Algorithms, 2017 The algorithm MLS (Maximal Label Search) is a graph search algorithm that generalizes the algorithms Maximum Cardinality Search (MCS), Lexicographic Breadth-First Search (LexBFS), Lexicographic Depth-First Search (LexDFS) and Maximal Neighborhood Search (MNS). On a chordal graph, MLS computes a PEO (perfect elimination ordering) of the graph.
Berry, Anne, Simonet, Geneviève
openaire +4 more sources
Recognizing Helly Edge-Path-Tree graphs and their clique graphs
Discrete Applied Mathematics, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
CARAMIA, MASSIMILIANO, Apollonio, N.
openaire +6 more sources
, 2016 We prove that every 3-connected planar graph on $n$ vertices contains an induced path on $\Omega(\log n)$ vertices, which is best possible and improves the best known lower bound by a multiplicative factor of $\log \log n$.
Esperet, Louis +2 more
core +3 more sources
Fixed Simplex Property for Retractable Complexes
Fixed Point Theory and Applications, 2010 Retractable complexes are defined in this paper. It is proved that they have the fixed simplex property for simplicial maps. This implies the theorem of Wallace and the theorem of Rival and Nowakowski for finite trees: every simplicial map transforming ...
Zapart Anna, Idzik Adam
doaj
, 2008 Several overlay-based live multimedia streaming platforms have been proposed in the recent peer-to-peer streaming literature. In most of the cases, the overlay neighbors are chosen randomly for robustness of the overlay.
Asaduzzaman, Shah +2 more
core +3 more sources
Treewidth versus clique number. II. Tree-independence number
Journal of Combinatorial Theory, Series BIn 2020, we initiated a systematic study of graph classes in which the treewidth can only be large due to the presence of a large clique, which we call $(\mathrm{tw},ω)$-bounded. While $(\mathrm{tw},ω)$-bounded graph classes are known to enjoy some good algorithmic properties related to clique and coloring problems, it is an interesting open problem ...
Dallard, Clément +2 more
openaire +2 more sources
A Note on Graphs of Linear Rank-Width 1 [PDF]
, 2013 We prove that a connected graph has linear rank-width 1 if and only if it is a distance-hereditary graph and its split decomposition tree is a path. An immediate consequence is that one can decide in linear time whether a graph has linear rank-width at ...
Bui-Xuan, Binh-Minh +2 more
core
Random enriched trees with applications to random graphs
, 2016 We establish limit theorems that describe the asymptotic local and global geometric behaviour of random enriched trees considered up to symmetry. We apply these general results to random unlabelled weighted rooted graphs and uniform random unlabelled $k$-
Stufler, Benedikt
core +1 more source
An extended approach for lifting clique tree inequalities
Journal of Combinatorial Optimization, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fischer, Anja, Fischer, Frank
openaire +3 more sources