Results 61 to 70 of about 28,286 (155)

Learning Bounded Treewidth Bayesian Networks with Thousands of Variables [PDF]

, 2016
We present a method for learning treewidth-bounded Bayesian networks from data sets containing thousands of variables. Bounding the treewidth of a Bayesian greatly reduces the complexity of inferences.
Corani, Giorgio, de Campos, Cassio P., Scanagatta, Mauro, Zaffalon, Marco   +3 more
core   +1 more source

Moving to Extremal Graph Parameters [PDF]

, 2013
Which graphs, in the class of all graphs with given numbers n and m of edges and vertices respectively, minimizes or maximizes the value of some graph parameter? In this paper we develop a technique which provides answers for several different parameters:
Cameron, P. J., Glass, C. A., Schumacher, R. U.   +2 more
core  

Unique Perfect Phylogeny Characterizations via Uniquely Representable Chordal Graphs

, 2013
The perfect phylogeny problem is a classic problem in computational biology, where we seek an unrooted phylogeny that is compatible with a set of qualitative characters.
Gysel, Rob
core  

Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars

, 2017
Tree-adjoining grammars are a generalization of context-free grammars that are well suited to model human languages and are thus popular in computational linguistics. In the tree-adjoining grammar recognition problem, given a grammar $ $ and a string $s$ of length $n$, the task is to decide whether $s$ can be obtained from $ $.
Bringmann, Karl, Wellnitz, Philip
openaire   +7 more sources

Clique coloring EPT graphs on bounded degree trees

Revista de la Unión Matemática Argentina
Summary: The edge-intersection graph of a family of paths on a host tree is called an EPT graph. When the host tree has maximum degree \(h\), we say that the graph is \([h,2,2]\). If the host tree also satisfies being a star, we have the corresponding classes of EPT-star and \([h,2,2]\)-star graphs.
de Caria, Pablo Jesús, Mazzoleni, María Pía, Payo Vidal, María Guadalupe   +2 more
openaire   +3 more sources

Parity Games of Bounded Tree- and Clique-Width [PDF]

, 2015
In this paper it is shown that deciding the winner of a parity game is in LogCFL, if the underlying graph has bounded tree-width, and in LogDCFL, if the tree-width is at most 2. It is also proven that parity games of bounded clique-width can be solved in LogCFL via a log-space reduction to the bounded tree-width case, assuming that a k-expression for ...
openaire   +1 more source

Embedding trees into clique-bridge-clique graphs [PDF]

Časopis pro pěstování matematiky, 1979
openaire   +2 more sources

Evasive sets, twisted varieties, and container-clique trees

In the affine space $\mathbb{F}_q^n$ over the finite field of order $q$, a point set $S$ is said to be $(d,k,r)$-evasive if the intersection between $S$ and any variety, of dimension $k$ and degree at most $d$, has cardinality less than $r$. As $q$ tends to infinity, the size of a $(d,k,r)$-evasive set in $\mathbb{F}_q^n$ is at most $O\left(q^{n-k ...
Lim, Jeck, Nie, Jiaxi, Zeng, Ji
openaire   +2 more sources

Fractional colorings of partial t-trees with no large clique

Discrete Mathematics
9 ...
openaire   +2 more sources

(Treewidth, Clique)-Boundedness and Poly-logarithmic Tree-Independence

An {\em independent set} in a graph $G$ is a set of pairwise non-adjacent vertices. A {\em tree decomposition} of $G$ is a pair $(T, χ)$ where $T$ is a tree and $χ: V(T) \rightarrow 2^{V(G)}$ is a function satisfying the following two axioms: for every edge $uv \in V(G)$ there is a $x \in V(T)$ such that $\{u,v\} \subseteq χ(x)$, and for every vertex ...
Chudnovsky, Maria, S, Ajaykrishnan E, Lokshtanov, Daniel   +2 more
openaire   +2 more sources