Results 41 to 50 of about 28,286 (155)
Shrub-depth: Capturing Height of Dense Graphs
, 2019 The recent increase of interest in the graph invariant called tree-depth and in its applications in algorithms and logic on graphs led to a natural question: is there an analogously useful "depth" notion also for dense graphs (say; one which is stable ...
de Mendez, Patrice Ossona +4 more
core +1 more source
Bayesian Learning of Clique Tree Structure
, 2017 The problem of categorical data analysis in high dimensions is considered. A discussion of the fundamental difficulties of probability modeling is provided, and a solution to the derivation of high dimensional probability distributions based on Bayesian learning of clique tree decomposition is presented.
Savkli, Cetin +3 more
openaire +2 more sources
From tree-decompositions to clique-width terms [PDF]
Discrete Applied Mathematics, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Exploiting Chordality in Optimization Algorithms for Model Predictive Control
, 2017 In this chapter we show that chordal structure can be used to devise efficient optimization methods for many common model predictive control problems.
A Alessio +17 more
core +1 more source
Embedding a Forest in a Graph [PDF]
, 2010 For \math{p\ge 1}, we prove that every forest with \math{p} trees whose sizes are $a_1,..., a_p$ can be embedded in any graph containing at least $\sum_{i=1}^p (a_i + 1)$ vertices and having a minimum degree at least $\sum_{i=1}^p a_i$.Comment: Working ...
Goldberg, Mark, Magdon-Ismail, Malik
core
Oriented coloring on recursively defined digraphs
, 2019 Coloring is one of the most famous problems in graph theory. The coloring problem on undirected graphs has been well studied, whereas there are very few results for coloring problems on directed graphs. An oriented k-coloring of an oriented graph G=(V,A)
Gurski, Frank +2 more
core +1 more source
The Algorithmic Complexity of Tree-Clique Width
, 2021 Tree-width has been proven to be a useful parameter to design fast and efficient algorithms for intractable problems. However, while tree-width is low on relatively sparse graphs can be arbitrary high on dense graphs. Therefore, we introduce tree-clique width, denoted by $tcl(G)$ for a graph $G$, a new width measure for tree decompositions.
openaire +2 more sources
Matching free trees, maximal cliques, and monotone game dynamics [PDF]
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2001 Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an association graph whose maximal cliques are in one-to-one correspondence with maximal common subtrees.
openaire +3 more sources
The Ramsey Theory of Henson graphs
, 2020 Analogues of Ramsey's Theorem for infinite structures such as the rationals or the Rado graph have been known for some time. In this context, one looks for optimal bounds, called degrees, for the number of colors in an isomorphic substructure rather than
Dobrinen, Natasha
core
Ordered increasing k-trees: Introduction and analysis of a preferential attachment network model
, 2010 We introduce a random graph model based on k-trees, which can be generated by applying a probabilistic preferential attachment rule, but which also has a simple combinatorial description.
Panholzer, Alois, Seitz, Georg
core +2 more sources