A Linear Time Algorithm for a Variant of the MAX CUT Problem in Series Parallel Graphs
نویسنده
چکیده
Given a graph G=(V, E), a connected sides cut (U, V\U) or δ(U) is the set of edges of E linking all vertices of U to all vertices of V\U such that the induced subgraphs G[U] and G[V\U] are connected. Given a positive weight function w defined on E, the maximum connected sides cut problem is to find a connected sides cut Ω such that w(Ω) is maximum. This problem is NP-hard. In this paper, we give a linear time algorithm to solve the maximum connected sides cut problem for series parallel graphs. We deduce a linear time algorithm for the minimum cut problem in the same class of graphs without computing the maximum flow.
منابع مشابه
Time Variant Fuzzy Time Series Approach for Forecasting Using Particle Swarm Optimization
Fuzzy time series have been developed during the last decade to improve the forecast accuracy. Many algorithms have been applied in this approach of forecasting such as high order time invariant fuzzy time series. In this paper, we present a hybrid algorithm to deal with the forecasting problem based on time variant fuzzy time series and particle swarm optimization algorithm, as a highly effi...
متن کاملA New ILP Model for Identical Parallel-Machine Scheduling with Family Setup Times Minimizing the Total Weighted Flow Time by a Genetic Algorithm
This paper presents a novel, integer-linear programming (ILP) model for an identical parallel-machine scheduling problem with family setup times that minimizes the total weighted flow time (TWFT). Some researchers have addressed parallel-machine scheduling problems in the literature over the last three decades. However, the existing studies have been limited to the research of independent jobs,...
متن کاملThe robust vertex centdian location problem with interval vertex weights on general graphs
In this paper, the robust vertex centdian location problem with uncertain vertex weights on general graphs is studied. The used criterion to solve the problem is the min-max regret criterion. This problem is investigated with objective function contains $lambda$ and a polynomial time algorithm for the problem is presented. It is shown that the vertex centdian problem on general graphs i...
متن کاملParallelizing Assignment Problem with DNA Strands
Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...
متن کاملA Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs
We deal with the maximum cut problem on cubic graphs and we present a simple O(log n) time parallel algorithm, running on a CRCW PRAM with O(n) processors. The approximation ratio of our algorithm is 1.3̄ and improves the best known parallel approximation ratio, i.e. 2, in the special case of cubic graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Adv. Operations Research
دوره 2017 شماره
صفحات -
تاریخ انتشار 2017