Results 11 to 20 of about 477,458 (300)
Quantum complexity of minimum cut [PDF]
, 2020 info:eu-repo/semantics ...
Apers, Simon, Lee, Troy
core +8 more sources
2009 International Conference on Game Theory for Networks, 2009 In this paper we introduce a cooperative game based on the minimum cut tree problem which is also known as multi-terminal maximum flow problem. In a routing situation a network with capacities induced by vertices of a coalition has to be substituted by a network providing the same capacity for non-simultaneous flows but having a minimum number of edges
Schwahn, Anne M.
openaire +2 more sources
On chromatic number and minimum cut [PDF]
Journal of Combinatorial Theory, Series B, 2019 For a graph $G$, the tree graph ${\cal T}_{G,t}$ has all tree subgraphs of $G$ with $t$ vertices as vertex set and two tree subgraphs are neighbors if they are edge-disjoint. Also, the $r^{th}$ cut number of $G$ is the minimum number of edges between parts of a partition of vertex set of $G$ into two parts such that each part has size at least $r$.
Meysam Alishahi, Hossein Hajiabolhassan
openaire +3 more sources
Distributed Minimum Cut Approximation [PDF]
, 2013 We study the problem of computing approximate minimum edge cuts by distributed algorithms. We use a standard synchronous message passing model where in each round, $O(\log n)$ bits can be transmitted over each edge (a.k.a. the CONGEST model). We present a distributed algorithm that, for any weighted graph and any $ε\in (0, 1)$, with high probability ...
Ghaffari, Mohsen, Kuhn, Fabian
openaire +5 more sources
Minimum Vertex Cut with Reachable Set (MVCRS) Problem for Suppressing Botnet Propagation in IoT Networks: Complexity and Algorithms [PDF]
SensorsThis paper formulates the “Minimum Vertex Cut with Reachable Set” (MVCRS) problem as an optimization framework to suppress botnet propagation in networked systems, and clarifies its computational complexity and algorithmic solutions.
Shingo Yamaguchi
doaj +2 more sources
Minimum cut bases in undirected networks
Discrete Applied Mathematics, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bunke, Florentine +3 more
openaire +5 more sources
Approximation algorithm for maximum flow network interdiction problem [PDF]
Iranian Journal of Numerical Analysis and Optimization, 2020 We consider the maximum flow network interdiction problem. We provide a new interpretation of the problem and define a concept called ”optimalcut”.
M. Afsharirad
doaj +1 more source
Query Complexity of Global Minimum Cut [PDF]
, 2021 In this work, we resolve the query complexity of global minimum cut problem for a graph by designing a randomized algorithm for approximating the size of minimum cut in a graph, where the graph can be accessed through local queries like Degree, Neighbor,
Bishnu, Arijit +3 more
core +1 more source
Local Times of Galactic Cosmic Ray Intensity Maximum and Minimum in the Diurnal Variation [PDF]
Journal of Astronomy and Space Sciences, 2006 The Diurnal variation of galactic cosmic ray (GCR) flux intensity observed by the ground Neutron Monitor (NM) shows a sinusoidal pattern with the amplitude of 1sim 2 % of daily mean.
Su Yeon Oh, Yu Yi
doaj +1 more source
The Structure of Minimum Vertex Cuts
CoRR, 2021 In this paper we continue a long line of work on representing the cut structure of graphs. We classify the types minimum vertex cuts, and the possible relationships between multiple minimum vertex cuts. As a consequence of these investigations, we exhibit a simple $O(κn)$-space data structure that can quickly answer pairwise $(κ+1)$-connectivity ...
Seth Pettie, Longhui Yin
openaire +4 more sources