# A combinatorial algorithm for finding maximum cuts

 Page 1 / 3
This report summarizes work done as part of the Wavelet Based Image Analysis PFUG under Rice University's VIGRE program. VIGRE is a program of Vertically Integrated Grants for Research and Education in the Mathematical Sciences under the direction of the National Science Foundation. A PFUG is a group of Postdocs, Faculty, Undergraduates and Graduate students formed round the study of a common problem. This module provides mathematical background on the maxcut problem and develops an exact branch and bound algorithm for the maximum cut of unweighted graphs that is designed for improved performance on sparse graphs.

## Introduction

Finding the maximum cut of a graph is a difficult to compute problem in combinatorial optimization with several applications in the world of engineering and physics. This research develops and evaluates an exact branch and bound algorithm for the maximum cut of unweighted graphs that is designed for improved performance on sparse graphs.

The module provides a general overview of the problem along with necessary mathematical background in "The Maxcut Problem" and a brief note on various approaches to the problem in "Several Algorithms" . "A New Algorithm" describes a new algorithm for finding maximum cuts. Results of empirical performance evaluation appear in "Empirical Testing" , which "Conclusion" further discusses.

## The maxcut problem

Before discussing the maxcut problem, it is necessary to provide some background information regarding relevant concepts in graph theory, the most fundamental of which is the graph itself. A graph $G\left(V,E\right)$ is an ordered pair comprised of a set of vertices V and a set of edges E that connect pairs of distinct vertices in V . Two examples are shown in [link] . Graphs may be either weighted, in which a real value is assigned to each edge, or unweighted, in which all edges have equal value. Although the former is more broadly applicable, further discussion will focus almost exclusively on the latter.

Unsurprisingly, a subgraph ${G}_{1}\left({V}_{1},{E}_{1}\right)$ of graph $G\left(V,E\right)$ is a graph with vertex set ${V}_{1}\subseteq V$ and edge set ${E}_{1}\subseteq E$ . Of particular usefulness will be the subgraph of $G\left(V,E\right)$ induced by a given set of edges ${E}_{1}\subseteq E$ , known as edge induced subgraph, which consists of that given set of edges E 1 along with all vertices ${V}_{1}=\left\{v|\left(u,v\right)\in ,{E}_{1},,,u,\in ,V\right\}$ that occur as an endpoint of at least one edge in E 1 . An example of an edge induced subgraph is shown in [link] .

One class of graphs that will be especially important to discussion of the maxcut problem is bipartite graphs. A graph $G\left(V,E\right)$ is bipartite, like the example in [link] , if there are sets ${V}_{1},{V}_{2}\subseteq V$ such that ${V}_{1}\cup {V}_{2}=V$ , ${V}_{1}\cap {V}_{2}=\varnothing$ , and $\left(u,v\right)\in E$ only if $u\in {V}_{1},v\in {V}_{2}$ or $v\in {V}_{1},u\in {V}_{2}$ . Additionally, a graph is bipartite if and only if it has no subgraph that is a cycle of odd length.

A cut of a graph can be informally understood and visualized as a closed curve crossing some realization of the graph where each edge can be crossed at most once, as seen in [link] . Notice that the curve partitions the graph vertices into two disjoint subsets located to each side of the curve.

Preparation and Applications of Nanomaterial for Drug Delivery
Application of nanotechnology in medicine
what is variations in raman spectra for nanomaterials
I only see partial conversation and what's the question here!
what about nanotechnology for water purification
please someone correct me if I'm wrong but I think one can use nanoparticles, specially silver nanoparticles for water treatment.
Damian
yes that's correct
Professor
I think
Professor
what is the stm
is there industrial application of fullrenes. What is the method to prepare fullrene on large scale.?
Rafiq
industrial application...? mmm I think on the medical side as drug carrier, but you should go deeper on your research, I may be wrong
Damian
How we are making nano material?
what is a peer
What is meant by 'nano scale'?
What is STMs full form?
LITNING
scanning tunneling microscope
Sahil
how nano science is used for hydrophobicity
Santosh
Do u think that Graphene and Fullrene fiber can be used to make Air Plane body structure the lightest and strongest. Rafiq
Rafiq
what is differents between GO and RGO?
Mahi
what is simplest way to understand the applications of nano robots used to detect the cancer affected cell of human body.? How this robot is carried to required site of body cell.? what will be the carrier material and how can be detected that correct delivery of drug is done Rafiq
Rafiq
if virus is killing to make ARTIFICIAL DNA OF GRAPHENE FOR KILLED THE VIRUS .THIS IS OUR ASSUMPTION
Anam
analytical skills graphene is prepared to kill any type viruses .
Anam
Any one who tell me about Preparation and application of Nanomaterial for drug Delivery
Hafiz
what is Nano technology ?
write examples of Nano molecule?
Bob
The nanotechnology is as new science, to scale nanometric
brayan
nanotechnology is the study, desing, synthesis, manipulation and application of materials and functional systems through control of matter at nanoscale
Damian
Is there any normative that regulates the use of silver nanoparticles?
what king of growth are you checking .?
Renato
What fields keep nano created devices from performing or assimulating ? Magnetic fields ? Are do they assimilate ?
why we need to study biomolecules, molecular biology in nanotechnology?
?
Kyle
yes I'm doing my masters in nanotechnology, we are being studying all these domains as well..
why?
what school?
Kyle
biomolecules are e building blocks of every organics and inorganic materials.
Joe
anyone know any internet site where one can find nanotechnology papers?
research.net
kanaga
sciencedirect big data base
Ernesto
Introduction about quantum dots in nanotechnology
hi
Loga
how did you get the value of 2000N.What calculations are needed to arrive at it
Privacy Information Security Software Version 1.1a
Good
Got questions? Join the online conversation and get instant answers!