Results 121 to 130 of about 2,320 (298)
Lower Bounds for Maximum Weight Bisections of Weighted Triangle‐Free Subcubic Graphs
Journal of Graph Theory, EarlyView.ABSTRACT A bisection of a graph is a cut in which the number of vertices in the two parts of the cut differ by at most 1. In this paper, we consider maximum weight bisections of edge‐weighted triangle‐free subcubic graphs and show that every weighted triangle‐free subcubic graph G = ( V , E , w ) $G=(V,E,w)$ has a bisection with weight at least θ ⋅ w (
Stefanie Gerke +3 more
wiley +1 more source
Exact and Robust Reconstructions of Integer Vectors Based on Multidimensional Chinese Remainder Theorem (MD-CRT). [PDF]
IEEE Trans Signal Process, 2020 Xiao L, Xia XG, Wang YP.
europepmc +1 more source
Sharing DSS by the Chinese Remainder Theorem [PDF]
, 2010 In this paper, we propose a new threshold scheme for the Digital Signature Standard (DSS) using Asmuth-Bloom secret sharing based on the Chinese Remainder Theorem (CRT).
Ali Aydın Selçuk, Kamer Kaya
core
Density Conditions for k $k$ Vertex‐Disjoint Triangles in Tripartite Graphs
Journal of Graph Theory, EarlyView.ABSTRACT Let n , k $n,k$ be positive integers such that n ≥ k $n\ge k$ and G $G$ be a tripartite graph with parts A , B , C $A,B,C$ such that ∣ A ∣ = ∣ B ∣ = ∣ C ∣ = n $| A| =| B| =| C| =n$. Denote the edge densities of G [ A , B ] , G [ A , C ] $G[A,B],G[A,C]$ and G [ B , C ] $G[B,C]$ by α , β $\alpha ,\beta $ and γ $\gamma $, respectively.
Mingyang Guo, Klas Markström
wiley +1 more source
Congruences in Zn, finite Abelian groups and the Chinese remainder theorem
, 1987 A natural generalization to Zn of the concept of congruence leads to the consideration of finite Abelian groups whose structure is obtained from the Smith normal form theorem for integral matrices.
Fiol, M.A
core +1 more source
Journal of Graph Theory, EarlyView.ABSTRACT In an effort to understand the complexity of the maximum independent set problem, Chvátal introduced t‐perfect graphs. While a full characterization of this class remains open, important progress has been made for claw‐free graphs [Bruhn and Stein, Math. Program. 2012] and P 5 ${P}_{5}$‐free graphs [Bruhn and Fuchs, SIAM J. Discrete Math. 2017]
Yixin Cao, Shenghua Wang
wiley +1 more source
An Efficient Lightweight Authentication Scheme for Smart Meter
MathematicsWith the rapid development of the information age, smart meters play an important role in the smart grid. However, there are more and more attacks on smart meters, which mainly focus on the identity authentication of smart meters and the security ...
Jingqi Du +5 more
doaj +1 more source
, 2004 We present a computationally efficient method for solving the method of excess fractions used in multi-frequency interferometry for absolute phase measurement.
Towers, Catherine E. +2 more
core +1 more source
Last‐minute coordination: Adapting to demand to support last‐mile operations
Journal of Operations Management, Volume 71, Issue 2, Page 176-194, March 2025.Abstract In the highly competitive e‐commerce industry, customer‐facing warehouses are crucial as the “order penetration points” for e‐commerce last‐mile operations. This research examines how warehouses use last‐minute coordination, an unstructured mechanism, to ensure sufficient inventory at the order penetration points. Previous research has focused
Kedong Chen +3 more
wiley +1 more source
Rigorous Electromagnetic Quasinormal‐Mode Method Made Easy for Users
Laser &Photonics Reviews, EarlyView.We present a method that combines numerical techniques with accurate approximations to enable simple and ultrafast computations of the scattered field based on quasinormal modes expansions. The method is made available in the open‐source package MANlite implemented within COMSOL.
Tong Wu, Philippe Lalanne
wiley +1 more source