Results 1  10
of
192,991
Randomized Heuristics for the MaxCut Problem
 Optimization Methods and Software
, 2002
"... Given an undirected graph with edge weights, the MAXCUT problem consists in finding a partition of the nodes into two subsets, such that the sum of the weights of the edges having endpoints in different subsets is maximized. ..."
Abstract

Cited by 40 (17 self)
 Add to MetaCart
Given an undirected graph with edge weights, the MAXCUT problem consists in finding a partition of the nodes into two subsets, such that the sum of the weights of the edges having endpoints in different subsets is maximized.
Maxcut Problem
, 2007
"... Maxcut problem is one of many NPhard graph theory problems which attracted many researchers over the years. Though there is almost no hope in finding a polynomialtime algorithm for maxcut problem, various heuristics, or combination of optimization and heuristic methods have been developed to solv ..."
Abstract
 Add to MetaCart
Maxcut problem is one of many NPhard graph theory problems which attracted many researchers over the years. Though there is almost no hope in finding a polynomialtime algorithm for maxcut problem, various heuristics, or combination of optimization and heuristic methods have been developed
MaxCut in Hfree graphs
"... For a graph G, let f(G) denote the maximum number of edges in a cut of G. For an integer m and for a fixed graph H, let f(m, H) denote the minimum possible cardinality of f(G), as G ranges over all graphs on m edges that contain no copy of H. In this paper we study this function for various graphs H ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
For a graph G, let f(G) denote the maximum number of edges in a cut of G. For an integer m and for a fixed graph H, let f(m, H) denote the minimum possible cardinality of f(G), as G ranges over all graphs on m edges that contain no copy of H. In this paper we study this function for various graphs
An Experimental Comparison of MinCut/MaxFlow Algorithms for Energy Minimization in Vision
 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 2001
"... After [10, 15, 12, 2, 4] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in lowlevel vision. The combinatorial optimization literature provides many mincut/maxflow algorithms with different polynomial time compl ..."
Abstract

Cited by 1311 (54 self)
 Add to MetaCart
After [10, 15, 12, 2, 4] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in lowlevel vision. The combinatorial optimization literature provides many mincut/maxflow algorithms with different polynomial time
Community detection in graphs
, 2009
"... The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices of th ..."
Abstract

Cited by 801 (1 self)
 Add to MetaCart
The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices
A Critical Point For Random Graphs With A Given Degree Sequence
, 2000
"... Given a sequence of nonnegative real numbers 0 ; 1 ; : : : which sum to 1, we consider random graphs having approximately i n vertices of degree i. Essentially, we show that if P i(i \Gamma 2) i ? 0 then such graphs almost surely have a giant component, while if P i(i \Gamma 2) i ! 0 the ..."
Abstract

Cited by 511 (8 self)
 Add to MetaCart
then almost surely all components in such graphs are small. We can apply these results to G n;p ; G n;M , and other wellknown models of random graphs. There are also applications related to the chromatic number of sparse random graphs.
Results 1  10
of
192,991