We derive normal approximation bounds in the Wasserstein distance for sums of generalized U-statistics, based on a general bound functionals independent random variables arbitrary distributions. Those are applied to combined weights subgraphs Erdős–Rényi graph, extending graph counting results Barbour et al. (A central limit theorem decomposable with applications graphs, J. Combin. Theory Ser. ...

The graphs considered in this paper are finite, undirected and simple. For a graph G, we denote its vertex set by V (G) and its edge set by E(G). A graph labeling, as introduced in [8], is an assignment of integers to the vertices or edges, or both, subject to certain conditions. Over the years, a large variety of different types of graph labelings have been studied, see [2] for an extensive su...

Finding the Bayesian network that maximizes a score function is known as structure learning or structure discovery. Most approaches use local search in the space of acyclic digraphs, which is prone to local maxima. Exhaustive enumeration requires super-exponential time. In this paper we describe a “merely” exponential space/time algorithm for finding a Bayesian network that corresponds to a glo...

Applications of graph and hypergraph decomposition techniques to SAT solving have been studied under various conditions. Theoretical research focused on the direction given by tree decompositions, while practical approaches either integrated tree decomposition guidance into existing SAT solver, or studied splitting techniques using hypergraph cuts. In this article we present a uniform and gener...

This work presents a Boolean satisfiability (SAT) encoding for a special problem from combinatorial optimization. In the last years much progress has been made in the optimization of practical SAT solvers (see the SAT competition [5]). This has made SAT encodings for combinatorial problems highly attractive. In this work we propose an encoding for the combinatorial problem Magic Labeling which ...