Maximum Cut (Maximum Cut)
Revision as of 10:25, 15 February 2023 by Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Maximum Cut (Maximum Cut)}} == Description == Given a graph $G=(V, E)$ with edge weights $c_e > 0$ for all $e\in E$, find a cut $\delta(W)$ such that $c(\delta(W)):=\Sigma_{e\in \dela(W)} c_e$ is as large as possible. == Parameters == <pre>n: number of vertices m: number of edges</pre> == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width="100%" ! Name !! Year !! Time !! Space !! Approximation Factor !! Model !!...")
Description
Given a graph $G=(V, E)$ with edge weights $c_e > 0$ for all $e\in E$, find a cut $\delta(W)$ such that $c(\delta(W)):=\Sigma_{e\in \dela(W)} c_e$ is as large as possible.
Parameters
n: number of vertices m: number of edges
Table of Algorithms
| Name | Year | Time | Space | Approximation Factor | Model | Reference |
|---|---|---|---|---|---|---|
| Hadlock | 1975 | $O({2}^V)$ | Exact | Deterministic |
Time Complexity graph
Error creating thumbnail: Unable to save thumbnail to destination