3204 search results - page 184 / 641 » The b-chromatic Number of a Graph |
NIPS
2003
13 years 11 months ago
2003
Belief propagation on cyclic graphs is an efficient algorithm for computing approximate marginal probability distributions over single nodes and neighboring nodes in the graph. I...
TIT
2008
13 years 10 months ago
2008
For a linear code , the stopping redundancy of is defined as the minimum number of check nodes in a Tanner graph T for such that the size of the smallest stopping set in T is equal...
ANTSW
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We consider the problem of finding and maintaining communication paths in wireless mobile ad hoc networks (MANET). We consider this problem as a bi-objective problem when...
EVOW
2004
Springer
14 years 3 months ago
2004
Springer
This paper describes a novel representation and ordering model that, aided by an evolutionary algorithm, is used in solving the graph k-colouring problem. Its strength lies in redu...
GD
2003
Springer
14 years 3 months ago
2003
Springer
We introduce an energy model whose minimum energy drawings reveal the clusters of the drawn graph. Here a cluster is a set of nodes with many internal edges and few edges to nodes ...