Results 1  10
of
361,588
Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming
 Journal of the ACM
, 1995
"... We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds the solution ..."
Abstract

Cited by 1231 (13 self)
 Add to MetaCart
We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds
"GrabCut”  interactive foreground extraction using iterated graph cuts
 ACM TRANS. GRAPH
, 2004
"... The problem of efficient, interactive foreground/background segmentation in still images is of great practical importance in image editing. Classical image segmentation tools use either texture (colour) information, e.g. Magic Wand, or edge (contrast) information, e.g. Intelligent Scissors. Recently ..."
Abstract

Cited by 1140 (36 self)
 Add to MetaCart
. Recently, an approach based on optimization by graphcut has been developed which successfully combines both types of information. In this paper we extend the graphcut approach in three respects. First, we have developed a more powerful, iterative version of the optimisation. Secondly, the power
Homomorphisms of 2edgecolored graphs
, 2009
"... In this paper, we study homomorphisms of 2edgecolored graphs, that is graphs with edges colored with two colors. We consider various graph classes (outerplanar graphs, partial 2trees, partial 3trees, planar graphs) and the problem is to find, for each class, the smallest number of vertices of a ..."
Abstract
 Add to MetaCart
In this paper, we study homomorphisms of 2edgecolored graphs, that is graphs with edges colored with two colors. We consider various graph classes (outerplanar graphs, partial 2trees, partial 3trees, planar graphs) and the problem is to find, for each class, the smallest number of vertices of a
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
On Restricted edgecolorings of bicliques
"... We investigate the minimum and maximum number of colors in edgecolorings of Kn,n such that every copy of Kp,p receives at least q and at most q ′ colors. Along the way we improve the bounds on some bipartite Turán numbers. ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
We investigate the minimum and maximum number of colors in edgecolorings of Kn,n such that every copy of Kp,p receives at least q and at most q ′ colors. Along the way we improve the bounds on some bipartite Turán numbers.
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
On the Simultaneous EdgeColoring Conjecture
, 2000
"... At the 16th British Combinatorial Conference (1997), Cameron introduced a new concept called 2simultaneous edgecoloring and conjectured that every bipartite graphic sequence, with all degrees at least 2, has a 2simultaneous edgecolorable realization. In fact, this conjecture is a reformulation o ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
At the 16th British Combinatorial Conference (1997), Cameron introduced a new concept called 2simultaneous edgecoloring and conjectured that every bipartite graphic sequence, with all degrees at least 2, has a 2simultaneous edgecolorable realization. In fact, this conjecture is a reformulation
Factor Graphs and the SumProduct Algorithm
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 1998
"... A factor graph is a bipartite graph that expresses how a "global" function of many variables factors into a product of "local" functions. Factor graphs subsume many other graphical models including Bayesian networks, Markov random fields, and Tanner graphs. Following one simple c ..."
Abstract

Cited by 1787 (72 self)
 Add to MetaCart
A factor graph is a bipartite graph that expresses how a "global" function of many variables factors into a product of "local" functions. Factor graphs subsume many other graphical models including Bayesian networks, Markov random fields, and Tanner graphs. Following one simple
A Framework for Dynamic Graph Drawing
 CONGRESSUS NUMERANTIUM
, 1992
"... Drawing graphs is an important problem that combines flavors of computational geometry and graph theory. Applications can be found in a variety of areas including circuit layout, network management, software engineering, and graphics. The main contributions of this paper can be summarized as follows ..."
Abstract

Cited by 627 (44 self)
 Add to MetaCart
Drawing graphs is an important problem that combines flavors of computational geometry and graph theory. Applications can be found in a variety of areas including circuit layout, network management, software engineering, and graphics. The main contributions of this paper can be summarized
Results 1  10
of
361,588