Results 41 to 50 of about 477,458 (300)
Evaluation of Municipal Water Distribution System Reliability Using Minimum Cut-set Method
Journal of King Saud University: Engineering Sciences, 2005 Reliability analysis of water distribution systems is a complex task, as it requires both definition and calculation of reliability measures. In this paper, a methodology for evaluating water distribution system reliability is developed and demonstrated ...
Muhammad A. Al-Zahrani, Juned Laiq Syed
doaj +1 more source
Two kinds of conditional connectivity of hypercubes
AKCE International Journal of Graphs and Combinatorics, 2022 A subset [Formula: see text] is called an h-extra r-component cut of G if G – F is disconnected and there are at least r components, each component has at least h + 1 vertices.
Bo Zhu +3 more
doaj +1 more source
4-tangrams are 4-avoidable [PDF]
Discrete Mathematics & Theoretical Computer ScienceA tangram is a word in which every letter occurs an even number of times. Thus it can be cut into parts that can be arranged into two identical words. The \emph{cut number} of a tangram is the minimum number of required cuts in this process.
Pascal Ochem, Théo Pierron
doaj +1 more source
Sufficient conditions for triangle-free graphs to be super-$λ'$ [PDF]
Transactions on Combinatorics, 2018 An edge-cut $F$ of a connected graph $G$ is called a restricted edge-cut if $G-F$ contains no isolated vertices. The minimum cardinality of all restricted edge-cuts is called the restricted edge-connectivity $λ'(G)$ of $G$. A graph $G$ is said to
Huiwen Cheng, Yan-Jing Li
doaj +1 more source
Extremal Dependence and Community-Structured Risk Propagation in Complex Social Information Networks
MathematicsExtreme opinion propagation in social information networks often appears as a low-frequency but high-impact process, in which abnormal activity becomes synchronized across structurally related users or communities during crisis periods.
Liang Wei, Hanzhi Wang, Yi Sun
doaj +1 more source
Shared-Memory Exact Minimum Cuts [PDF]
2019 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2019 The minimum cut problem for an undirected edge-weighted graph asks us to divide its set of nodes into two blocks while minimizing the weight sum of the cut edges. In this paper, we engineer the fastest known exact algorithm for the problem. State-of-the-art algorithms like the algorithm of Padberg and Rinaldi or the algorithm of Nagamochi, Ono and ...
Monika Henzinger +2 more
openaire +3 more sources
Minimum multiway cuts in trees
Discrete Applied Mathematics, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Péter L. Erdös +2 more
openaire +2 more sources
Blocking Detection Based on Synoptic Filters
Advances in Meteorology, 2011 The Tibaldi-Molteni blocking index is supplemented by additional filter criteria to eliminate cut-off lows and subsynoptic structures. We introduce three blocking filters and analyse their sensitivities: (i) a quantile filter requiring a minimum ...
Bernd Schalge +2 more
doaj +1 more source
Partitions of networks that are robust to vertex permutation dynamics
Special Matrices, 2015 Minimum disconnecting cuts of connected graphs provide fundamental information about the connectivity structure of the graph. Spectral methods are well-known as stable and efficient means of finding good solutions to the balanced minimum cut problem.
Froyland Gary, Kwok Eric
doaj +1 more source
Maderas: Ciencia y Tecnología, 2021 The surface roughness of wood is affected by the processing conditions and the material structure. So, optimization of operation parameters is very crucial to have minimum surface roughness. In this study, modeling and optimization of surface roughness (
Ayşenur Gürgen +3 more
doaj