Results 1  10
of
1,189
A Grouping Genetic Algorithm For Coloring The Edges Of Graphs
 Proceedings of the 2000 ACM/SIGAPP Symposium on Applied Computing, ACM
, 2000
"... This paper investigates applications of heuristic techniques for solving the edge coloring problem, which seeks the minimum number of colors to color the edges of a graph such that no two adjacent edges (edges that share a common vertex) get the same color. Except for special cases, such as bipartit ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
that the edge coloring problem is more amenable to grouping genetic algorithms. 1 INTRODUCTION The...
Finding community structure in networks using the eigenvectors of matrices
, 2006
"... We consider the problem of detecting communities or modules in networks, groups of vertices with a higherthanaverage density of edges connecting them. Previous work indicates that a robust approach to this problem is the maximization of the benefit function known as “modularity ” over possible div ..."
Abstract

Cited by 502 (0 self)
 Add to MetaCart
We consider the problem of detecting communities or modules in networks, groups of vertices with a higherthanaverage density of edges connecting them. Previous work indicates that a robust approach to this problem is the maximization of the benefit function known as “modularity ” over possible
Property Testing and its connection to Learning and Approximation
"... We study the question of determining whether an unknown function has a particular property or is fflfar from any function with that property. A property testing algorithm is given a sample of the value of the function on instances drawn according to some distribution, and possibly may query the fun ..."
Abstract

Cited by 475 (67 self)
 Add to MetaCart
the function on instances of its choice. First, we establish some connections between property testing and problems in learning theory. Next, we focus on testing graph properties, and devise algorithms to test whether a graph has properties such as being kcolorable or having a aeclique (clique of density ae
Graph Coloring with Adaptive Evolutionary Algorithms
, 1998
"... This paper presents the results of an experimental investigation on solving graph coloring problems with Evolutionary Algorithms (EA). After testing different algorithm variants we conclude that the best option is an asexual EA using orderbased representation and an adaptation mechanism that period ..."
Abstract

Cited by 45 (19 self)
 Add to MetaCart
that periodically changes the fitness function during the evolution. This adaptive EA is general, using no domain specific knowledge, except, of course, from the decoder (fitness function). We compare this adaptive EA to a powerful traditional graph coloring technique DSatur and the Grouping GA on a wide range
Fast heuristics for the edge coloring of large graphs
 Euromicro Symposium on Digital system design, DSD’03, IEEE computer Society
, 2003
"... Heuristic algorithms for coloring the edges of large undirected singleedge graphs with (or very close to) the minimal number of colors are presented. Compared to simulated annealing and a grouping genetic algorithm for small graphs, the heuristics were not only faster by orders of magnitude, but al ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Heuristic algorithms for coloring the edges of large undirected singleedge graphs with (or very close to) the minimal number of colors are presented. Compared to simulated annealing and a grouping genetic algorithm for small graphs, the heuristics were not only faster by orders of magnitude
Graph Coloring with Adaptive Genetic Algorithms
, 1996
"... This technical report summarizes our results on solving graph coloring problems with Genetic Algorithms (GA). After testing many different options we conclude that the best one is a (1+1) orderbased GA using an adaptation mechanism that periodically changes the fitness function, thus guiding the GA ..."
Abstract
 Add to MetaCart
This technical report summarizes our results on solving graph coloring problems with Genetic Algorithms (GA). After testing many different options we conclude that the best one is a (1+1) orderbased GA using an adaptation mechanism that periodically changes the fitness function, thus guiding
Spectral Partitioning of Random Graphs
, 2001
"... Problems such as bisection, graph coloring, and clique are generally believed hard in the worst case. However, they can be solved if the input data is drawn randomly from a distribution over graphs containing acceptable solutions. In this paper we show that a simple spectral algorithm can solve all ..."
Abstract

Cited by 165 (3 self)
 Add to MetaCart
Problems such as bisection, graph coloring, and clique are generally believed hard in the worst case. However, they can be solved if the input data is drawn randomly from a distribution over graphs containing acceptable solutions. In this paper we show that a simple spectral algorithm can solve all
Efficient Testing of Large Graphs
 Combinatorica
"... Let P be a property of graphs. An test for P is a randomized algorithm which, given the ability to make queries whether a desired pair of vertices of an input graph G with n vertices are adjacent or not, distinguishes, with high probability, between the case of G satisfying P and the case that it h ..."
Abstract

Cited by 176 (47 self)
 Add to MetaCart
Let P be a property of graphs. An test for P is a randomized algorithm which, given the ability to make queries whether a desired pair of vertices of an input graph G with n vertices are adjacent or not, distinguishes, with high probability, between the case of G satisfying P and the case
Almost all kcolorable graphs are easy to color
 In: J. Algorithms
, 1988
"... We describe a simple and e cient heuristic algorithm for the graph coloring problem and show that for all k it nds an optimal coloring for almost all kcolorable graphs We also show that an algorithm proposed by Brelaz and justi ed on experimental grounds optimally colors almost all kcolorable gr ..."
Abstract

Cited by 72 (0 self)
 Add to MetaCart
We describe a simple and e cient heuristic algorithm for the graph coloring problem and show that for all k it nds an optimal coloring for almost all kcolorable graphs We also show that an algorithm proposed by Brelaz and justi ed on experimental grounds optimally colors almost all kcolorable
Improved EdgeColoring Algorithms for Planar Graphs
 JOURNAL OF ALGORITHMS
, 1996
"... We consider the problem of edgecoloring planar graphs. It is known that a planar graph G with maximum degree \Delta \geq 8 can be colored with \Delta colors. We present two algorithms which find such a coloring when \Delta \geq 9. The first one is a sequential O(n log n) time algorithm. The other o ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
We consider the problem of edgecoloring planar graphs. It is known that a planar graph G with maximum degree \Delta \geq 8 can be colored with \Delta colors. We present two algorithms which find such a coloring when \Delta \geq 9. The first one is a sequential O(n log n) time algorithm. The other
Results 1  10
of
1,189