Let Q be a monotone decreasing property of graphs G on n vertices. Erdős, Suen and Winkler [5] introduced the following natural way of choosing a random maximal graph in Q: start with G the empty graph on n vertices. Add edges to G one at a time, each time choosing uniformly from all e ∈ G such that G + e ∈ Q. Stop when there are no such edges, so the graph G∞ reached is maximal in Q. Erdős, Su...

Clusterings of graphs are often constructed and evaluated with the aid of a quality measure. Numerous such measures exist, some of which adapt an established measure for graph cuts to clusterings. In this work we pursue the problem of finding clusterings which simultaneously feature guaranteed intraand good intercluster quality. To this end we systematically assemble a range of cut-based bicrit...

II Teile dieser Arbeit basieren auf Veröffentlichungen, die aus der Zusammenar-beit mit anderen Wissenschaftlerinnen und Wissenschaftlern entstanden sind. Zu allen diesen Inhalten wurden wesentliche Beiträge geleistet. Baumträger haben und ein Algorithmus, um einen solchen effizient zu berechnen, falls er existiert.

WebAssembly is a new binary instruction format that allows targeted compiled code written in high-level languages to be executed with near-native speed by the browser’s JavaScript engine. However, given binaries can from unsafe like C/C++, classical vulnerabilities such as buffer overflows or strings transferred over original programs down cross-compiled binaries. As result, this possibility of...

Objective(s)CpG oligodeoxynucleotides (CpG ODNs) have been shown to have potent immunostimulatory adjuvant activity for a wide range of antigens. Due to susceptibility of phosphodiester CpG ODNs (PO CpG) to nuclease degradation, nuclease-resistant phosphorothioate CpG ODNs (PS CpG) were currently utilized in an in vivo model. In this study, according to some recently reported drawbacks with PS ...

For many applications of reinforcement learning it can be more convenient to specify both a reward function and constraints, rather than trying to design behavior through the reward function. For example, systems that physically interact with or around humans should satisfy safety constraints. Recent advances in policy search algorithms (Mnih et al., 2016; Schulman et al., 2015; Lillicrap et al...

A graph homomorphism is an edge preserving vertex mapping between two graphs. Locally constrained homomorphisms are those that behave well on the neighborhoods of vertices — if the neighborhood of any vertex of the source graph is mapped bijectively (injectively, surjectively) to the neighborhood of its image in the target graph, the homomorphism is called locally bijective (injective, surjecti...

Let P be a set of n points in the plane and S a set of non-crossing line segments between vertices in P , called constraints. Two vertices are visible if the straight line segment connecting them does not properly intersect any constraints. The constrained θm-graph is constructed by partitioning the plane around each vertex into m disjoint cones, each with aperture θ = 2π/m, and adding an edge ...