منابع مشابه
Distributed Minimum Cut Approximation
We study the problem of computing approximate minimum edge cuts by distributed algorithms. We present two randomized approximation algorithms that both run in a standard synchronous message passing model where in each round, O(log n) bits can be transmitted over every edge (a.k.a. the CONGEST model). The first algorithm is based on a simple and new approach for analyzing random edge sampling, w...
متن کاملPractical Minimum Cut Algorithms
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. Here, we introduce a linear-time algorithm to compute near-minimum cuts. Our algorithm is based on cluster contraction using label propagation and Padberg and Rinaldi’s contraction heuristics [SIAM Review, 1991]. We give both sequenti...
متن کاملInapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove inapproximability results. We show that they have no polynomial time approximation scheme, unless NP-complete problems can be solved in randomized subexponential time. Furthermore, we show that the same techniques can b...
متن کاملA New Approach to Constructing A Minimum Edge Cut Set Based on Maximum Flow
The maximum flow algorithm has long been known for calculating the minimum edge cut of any two vertices of a connected graph. The original algorithm, however, does not tell us which edges should be taken exactly and therefore there could be more than one way to construct a minimum-edge-cut set. In this paper, we propose a new method to get a minimum-edge-cut set by selecting edges of a graph in...
متن کاملSome Edge Cut Sets and an Upper bound for Edge Tenacity of Organic Compounds CnH2n+2
The graphs play an important role in our daily life. For example, the urban transport network can be represented by a graph, as the intersections are the vertices and the streets are the edges of the graph. Suppose that some edges of the graph are removed, the question arises, how damaged the graph is. There are some criteria for measuring the vulnerability of graph; the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 2020
ISSN: 0028-3045,1097-0037
DOI: 10.1002/net.21928