Results 1 to 10 of about 1,935 (115)
Practical Minimum Cut Algorithms [PDF]
Journal of Experimental Algorithmics, 2018 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
Monika Henzinger +2 more
exaly +7 more sources
Inverse Minimum Cut Problem with Lower and Upper Bounds
Mathematics, 2020 The inverse minimum cut problem is one of the classical inverse optimization researches. In this paper, the inverse minimum cut with a lower and upper bounds problem is considered. The problem is to change both, the lower and upper bounds on arcs so that
Adrian Deaconu, Laura Ciupala
doaj +3 more sources
On the connectivity preserving minimum cut problem
Journal of Computer and System Sciences, 2014 In this paper, we study a generalization of the classical minimum cut prob- lem, called Connectivity Preserving Minimum Cut (CPMC) problem, which seeks a minimum cut to separate a pair (or pairs) of source and destination nodes and meanwhile ensure the connectivity between the source and its partner node(s).
Qi Duan, Jinhui Xu
exaly +4 more sources
Electric Grid Vulnerability Analysis to Identify Communities Prone to Wildfires
IEEE Access, 2023 Natural hazards, like wildfires, present various challenges to the electric grid that can leave many communities without power. To identify vulnerabilities in the grid and the corresponding at-risk communities, this work considers the implementation of ...
C. Birk Jones +2 more
doaj +1 more source
Minimum Cuts in Surface Graphs
SIAM Journal on Computing, 2023 We describe algorithms to efficiently compute minimum $(s,t)$-cuts and global minimum cuts of undirected surface-embedded graphs. Given an edge-weighted undirected graph $G$ with $n$ vertices embedded on an orientable surface of genus $g$, our algorithms can solve either problem in $g^{O(g)} n \log \log n$ or $2^{O(g)} n \log n$ time, whichever is ...
Erin W. Chambers +3 more
openaire +3 more sources
On the Number of Minimum Cuts in a Graph [PDF]
SIAM Journal on Discrete Mathematics, 2002 Summary: We relate the number of minimum cuts in a weighted undirected graph with various structural parameters of the graph. In particular, we provide upper bounds for the number of minimum cuts in terms of the radius, diameter, minimum degree, maximum degree, chordality, girth, and some other parameters of the graph.
Chandran, Sunil, Ram, Shankar L
openaire +4 more sources
Mathematics, 2022 The standard optimization of open-pit mine design and production scheduling, which is impacted by a variety of factors, is an essential part of mining activities.
Devendra Joshi +5 more
doaj +1 more source
The inverse maximum flow problem with lower and upper bounds for the flow [PDF]
Yugoslav Journal of Operations Research, 2008 The general inverse maximum flow problem (denoted GIMF) is considered, where lower and upper bounds for the flow are changed so that a given feasible flow becomes a maximum flow and the distance (considering l1 norm) between the initial vector of bounds ...
Deaconu Adrian
doaj +1 more source
Investigation of the cut on the separation of xenon stable isotopes in the square cascade [PDF]
مجله علوم و فنون هستهای, 2021 One of the important parameters in the square cascade, which has a great influence on its performance in the separation of multicomponent isotopes, is the cascade cut.
F. Mansourzadeh +4 more
doaj +1 more source
IEEE Access, 2020 The maximum capacity path problem is to find a path connecting two given nodes in a network such that the minimum arc capacity on this path is maximized.
Adrian M. Deaconu, Javad Tayyebi
doaj +1 more source