Results 31 to 40 of about 477,458 (300)
Minimum shared‐power edge cut [PDF]
Networks, 2020 AbstractWe introduce a problem called minimum shared‐power edge cut (MSPEC). The input to the problem is an undirected edge‐weighted graph with distinguished vertices s and t, and the goal is to find an s‐t cut by assigning “powers” at the vertices and removing an edge if the sum of the powers at its endpoints is at least its weight.
Sergio Cabello +3 more
openaire +3 more sources
Hypergraph cuts with edge-dependent vertex weights
Applied Network Science, 2022 We develop a framework for incorporating edge-dependent vertex weights (EDVWs) into the hypergraph minimum s-t cut problem. These weights are able to reflect different importance of vertices within a hyperedge, thus leading to better characterized cut ...
Yu Zhu, Santiago Segarra
doaj +1 more source
Environmental sustainability during machining of hardened steel using nanofluid: A case study [PDF]
E3S Web of Conferences, 2023 The positive effects of nanofluid-assisted minimum quantity lubrication include improved performance during machining and environmental sustainability. In the present study two cutting parameters levels such as feed rate of 0.05 (mm/rev)- depth of cut of
Khatai Saswat +3 more
doaj +1 more source
Nihon Kikai Gakkai ronbunshu, 2023 An experiment was conducted to proove that a single-point cutting tool made of nano-polycrystalline diamond with a cutting edge radius of 0.3 nm can fabricate a cut face without damaged layer by decreasing the depth of cut.
Takuya SEMBA +2 more
doaj +1 more source
Computing minimum cuts in hypergraphs [PDF]
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017 We study algorithmic and structural aspects of connectivity in hypergraphs. Given a hypergraph $H=(V,E)$ with $n = |V|$, $m = |E|$ and $p = \sum_{e \in E} |e|$ the best known algorithm to compute a global minimum cut in $H$ runs in time $O(np)$ for the uncapacitated case and in $O(np + n^2 \log n)$ time for the capacitated case.
Chandra Chekuri, Chao Xu 0002
openaire +2 more sources
Discussiones Mathematicae Graph Theory, 2022 A set S ⊆ V (G) is a vertex k-cut in a graph G = (V (G), E(G)) if G − S has at least k connected components. The k-connectivity of G, denoted as κk(G), is the minimum cardinality of a vertex k-cut in G. We give several constructions of a set S such that (
Erker Tjaša Paj, Špacapan Simon
doaj +1 more source
Approximate minimum cuts and their enumeration
, 2023 We show that every $α$-approximate minimum cut in a connected graph is the unique minimum $(S,T)$-terminal cut for some subsets $S$ and $T$ of vertices each of size at most $\lfloor2α\rfloor+1$. This leads to an alternative proof that the number of $α$-approximate minimum cuts in a $n$-vertex connected graph is $n^{O(α)}$ and they can all be enumerated
Calvin Beideman +2 more
openaire +2 more sources
Sufficient conditions for maximally edge-connected and super-edge-connected graphs
Communications in Combinatorics and Optimization, 2017 Let $G$ be a connected graph with minimum degree $\delta$ and edge-connectivity $\lambda$. A graph is maximally edge-connected if $\lambda=\delta$, and it is super-edge-connected if every minimum edge-cut is trivial; that is, if every ...
Lutz Volkmann, Zhen-Mu Hong
doaj +1 more source
PLoS ONE, 2021 IntroductionAs base excess had shown superiority over lactate as a prognostic parameter in intensive care unit (ICU) surgical patients we aimed to evaluate course of lactate, base excess and pH for prediction of mortality of medical ICU patients ...
Anja Schork +4 more
doaj +1 more source
Remote Sensing Image Change Detection Using Superpixel Cosegmentation
Information, 2021 The application of cosegmentation in remote sensing image change detection can effectively overcome the salt and pepper phenomenon and generate multitemporal changing objects with consistent boundaries.
Ling Zhu, Jingyi Zhang, Yang Sun
doaj +1 more source