Results 11 to 20 of about 2,902,197 (338)
Minimum Weight Flat Antichains of Subsets [PDF]
Order, 2021 Building on classical theorems of Sperner and Kruskal-Katona, we investigate antichains $\mathcal F$ in the Boolean lattice $B_n$ of all subsets of $[n]:=\{1,2,\dots,n\}$, where $\mathcal F$ is flat, meaning that it contains sets of at most two consecutive sizes, say $\mathcal F=\mathcal{A}\cup\mathcal{B}$, where $\mathcal{A}$ contains only $k$-subsets,
Griggs, Jerrold R. +4 more
openaire +3 more sources
On Minimum Maximal Distance-k Matchings [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 We study the computational complexity of several problems connected with finding a maximal distance-$k$ matching of minimum cardinality or minimum weight in a given graph. We introduce the class of $k$-equimatchable graphs which is an edge analogue of $k$
Yury Kartynnik, Andrew Ryzhikov
doaj +3 more sources
Minimum weight resolving sets of grid graphs [PDF]
, 2016 For a simple graph $G=(V,E)$ and for a pair of vertices $u,v \in V$, we say that a vertex $w \in V$ resolves $u$ and $v$ if the shortest path from $w$ to $u$ is of a different length than the shortest path from $w$ to $v$. A set of vertices ${R \subseteq
Patrick Andersen +2 more
openalex +4 more sources
Minimum weight design aspects of stiffened cylinders under compression [PDF]
, 1967 Survey on minimum weight design aspects of stiffened cylinders under ...
H. Becker, C. Lakshmikantham
openalex +3 more sources
On McEliece-Type Cryptosystems Using Self-Dual Codes With Large Minimum Weight
IEEE Access, 2023 One of the Round 3 Finalists in the NIST post-quantum cryptography call is the Classic McEliece cryptosystem. Although it is one of the most secure cryptosystems, the large size of its public key remains a practical limitation. In this work, we propose a
Luca Mariot +2 more
doaj +1 more source
Chemical Reaction Optimization for Minimum Weight Dominating Set
Applied Computational Intelligence and Soft Computing, 2023 Dominating set of a graph can be defined as the set of vertices that can cover all other vertices of the graph. The minimum weight dominating set (MWDS) is the minimum number of vertices in the dominating set with minimum total weight.
A. Pritam Khan Boni +1 more
doaj +1 more source
Crack modeling via minimum-weight surfaces in 3d Voronoi diagrams
Journal of Mathematics in Industry, 2023 As the number one building material, concrete is of fundamental importance in civil engineering. Understanding its failure mechanisms is essential for designing sustainable buildings and infrastructure.
Christian Jung, Claudia Redenbach
doaj +1 more source
Kernel Partial Least Squares Feature Selection Based on Maximum Weight Minimum Redundancy
Entropy, 2023 Feature selection refers to a vital function in machine learning and data mining. The maximum weight minimum redundancy feature selection method not only considers the importance of features but also reduces the redundancy among features.
Xiling Liu, Shuisheng Zhou
doaj +1 more source
Energies, 2020 Through applying an exemplary design study, the dependencies between current density, temperatures, and weight in an electrical drive system for a small range aircraft with conventional electrical fan or propeller drives are evaluated. This study applies
Jan Hoffmann +2 more
doaj +1 more source
On a linear program for minimum-weight triangulation [PDF]
, 2014 Minimum-weight triangulation (MWT) is NP-hard. It has a polynomial-time constant-factor approximation algorithm, and a variety of effective polynomial-time heuristics that, for many instances, can find the exact MWT.
Young, NE, Yousefi, A
core +3 more sources