Steiner
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
Terminal Steiner tree problem : Complexity and Algorithms
arXiv:2606.02325v1 Announce Type: new Abstract: Given a connected graph $G$ and a terminal set $R \subseteq V(G)$, the Steiner tree problem (ST) asks for a tree that spans all of $R$ with at most $r$ vertices from $V(G)\backslash R$, for some integer $r\geq 0$. It is known from (Garey et al.,1977 ) that ST is NP-complete.
Examining pandemic-informed coordinated responses to domestic violence
Examining pandemic-informed coordinated responses to domestic violence Stephanie Baum Scientific Editor Andrew Zinin Lead Editor Though the immediate disruptions of the COVID-19 pandemic have passed, the six-year anniversary of the event's onset allows medical professionals, community support organizations, and researchers to analyze the pandemic's challenges and better prepare for the future. University of Delaware Associate Professor Ruth E. Fleury-Steiner has taken up this charge in the...
Classification of independent sets in signed Johnson graphs and applications to kissing arrangements
Announce Type: new Abstract: Johnson graph are a family of graphs that play an important role in the theory of constant-weight codes, extremal combinatorics, and combinatorial geometry. We study signed analogues of classical Johnson graphs, denoted by $J_\pm(n,k)$, whose vertices are vectors of the form $\pm e_{i_1}\pm\cdots\pm e_{i_k}$, where two vertices are adjacent whenever their dot product equals $k-1$. We are particularly interested in maximum independent sets in the case $k=4$. An...