Results 1 
2 of
2
Graph coloring algorithms for assignment problems in radio networks
 APPLICATIONS OF NEURAL NETWORKS TO TELECOMMUNICATIONS 2
, 1995
"... Assignment problems in radio networks, like the channel assignment, may be solved by graph coloring algorithms. In this paper we compare the performance of several recent techniques on a simple coloring problem: the search for a bipartite subgraph with the maximum number of edges of a given graph. T ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
Assignment problems in radio networks, like the channel assignment, may be solved by graph coloring algorithms. In this paper we compare the performance of several recent techniques on a simple coloring problem: the search for a bipartite subgraph with the maximum number of edges of a given graph. The algorithms considered are a neural network, a genetic algorithm, simulated annealing and two heuristics. The results show that one heuristic, a new proposed multiagent system, and the standard simulated annealing technique are faster outperforming the algorithms in the literature. We also show how the algorithms may be easily adapted to deal with the kcoloring of a graph and can therefore be used for solving assignment problems in telecommunications.
Genetic Programming To Design Communication Algorithms For Parallel Architectures
, 1998
"... Broadcasting is an information dissemination problem in which a message originating at one node of a communication network (modeled as a graph) is to be sent to all other nodes as quickly as possible. This paper describes a new way of producing broadcasting schemes using genetic programming. This te ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Broadcasting is an information dissemination problem in which a message originating at one node of a communication network (modeled as a graph) is to be sent to all other nodes as quickly as possible. This paper describes a new way of producing broadcasting schemes using genetic programming. This technique has proven successful by easily finding optimal algorithms for several wellknown families of networks (grids, hypercubes and cycle connected cubes) and has indeed generated a new scheme for butterflies that improves the known upper bound for the broadcasting time of these networks. Keywords: Broadcasting, genetic programming, butterfly graph Parallel Processing Letters, to appear (1998). 1 Introduction There is considerable interest in the study of the propagation of information in interconnection networks. This research area is important because the ability of a network to effectively disseminate information is a good measure of the suitability of the network for parallel comput...