Exploring technologies to better link physical evidence and digital information for disaster victim identification. [PDF]
Forensic Sci Res, 2022 Lovell D +5 more
europepmc +1 more source
Playing in the Dark: Invisible Chess as a Laboratory for Strategic AI
AI &Innovation, EarlyView.This paper shows that strategic AI evaluated on perfect‐information benchmarks can be brittle in real adversarial settings. By using invisible chess as a benchmark for hidden state and deception, it argues for stricter testing, human oversight, and more cautious governance of high‐stakes AI systems.
Paolo Ciancarini
wiley +1 more source
Labellings of trees with maximum degree three - an improved bound [PDF]
, 2005 If $T=(V,E)$ is a tree on vertex set $V$, where $|V|=n$, a labelling of $T $ is a bijection $\phi$ from $V$ to $\{1,2,\dots,n\}$. The labelling induces an edge labelling ${\overline \phi}: E\rightarrow \{1,2,\dots,n-1\}$ by ${\overline \phi}(e)=|\phi(u)-\
Rosa, A., Siran, J., Brankovic, L.
core
Graceful coloring is computationally hard [PDF]
Given a (proper) vertex coloring $f$ of a graph $G$, say $f\colon V(G)\to \mathbb{N}$, the difference edge labelling induced by $f$ is a function $h\colon E(G)\to \mathbb{N}$ defined as $h(uv)=|f(u)-f(v)|$ for every edge $uv$ of $G$.
D., Laavanya +2 more
core +1 more source
Ringel's decomposition problem and graph labellings [PDF]
, 2017 During the 1963 international graph theory conference in Smolenice, Czechoslovakia, Gerhard Ringel formulated the following conjecture: The complete graph with vertices can be decomposed into subgraphs, each isomorphic to a given tree with edges ...
Rosa, Alexander
core
Sulfavant A as the first synthetic TREM2 ligand discloses a homeostatic response of dendritic cells after receptor engagement. [PDF]
Cell Mol Life Sci, 2022 Gallo C +12 more
europepmc +1 more source
Towards the Graceful Tree Conjecture: A Survey [PDF]
A graceful labelling of an undirected graph G with n edges is a one-to-one function from the set of vertices of G to the set {0, 1, 2,...,n} such that the induced edge labels are all distinct. An induced edge label is the absolute value of the difference
Brankovic, Ljiljana +3 more
core
Origin, Selection and Current Status of the Utrerana Chicken Breed: A Review. [PDF]
Animals (Basel), 2023 Plata-Casado A +2 more
europepmc +1 more source
Gracefully labelled trees from Skolem and related sequences [PDF]
, 2001 In this thesis we use Skolem sequences, hooked Skolem sequences, and periodic odd sequences to find graceful labellings of trees. -- Using a particular Skolem sequence of order n we will produce a graceful labelling of a certain tree on 2n vertices ...
Morgan, David
core
The computer, A choreographer? Aesthetic responses to randomly-generated dance choreography by a computer. [PDF]
Heliyon, 2023 Darda KM, Cross ES.
europepmc +1 more source