Sciweavers

2310 search results - page 219 / 462
» Coloring Random Graphs
Sort
View
WEA
2007
Springer
116views Algorithms» more  WEA 2007»
14 years 2 months ago
Optimal Edge Deletions for Signed Graph Balancing
The Balanced Subgraph problem (edge deletion variant) asks for a 2-coloring of a graph that minimizes the inconsistencies with given edge labels. It has applications in social netw...
Falk Hüffner, Nadja Betzler, Rolf Niedermeier
CRIWG
2007
13 years 9 months ago
Coordinating Multi-task Environments Through the Methodology of Relations Graph
Abstract. This paper presents Relations Graph – GR a methodology to automate the generation of coordination mechanisms in computational environments. GR explores encapsulation an...
Adailton José Alves Da Cruz, Léo Pin...
PAMI
2006
226views more  PAMI 2006»
13 years 8 months ago
Graph Partitioning Active Contours (GPAC) for Image Segmentation
In this paper we introduce new type of variational segmentation cost functions and associated active contour methods that are based on pairwise similarities or dissimilarities of t...
Baris Sumengen, B. S. Manjunath
APVIS
2008
13 years 9 months ago
Visual Statistics for Collections of Clustered Graphs
We propose a method to visually summarize collections of networks on which a clustering of the vertices is given. Our method allows for efficient comparison of individual networks...
Ulrik Brandes, Jürgen Lerner, Miranda J. Lubb...
GECCO
2009
Springer
100views Optimization» more  GECCO 2009»
14 years 2 months ago
Partial neighborhoods of elementary landscapes
This paper introduces a new component based model that makes it relatively simple to prove that certain types of landscapes are elementary. We use the model to reconstruct proofs ...
L. Darrell Whitley, Andrew M. Sutton