3204 search results - page 201 / 641 » The b-chromatic Number of a Graph |
106
Voted
LICS
2009
IEEE
15 years 7 months ago
2009
IEEE
Pointer programs are a model of structured computation within logspace. They capture the common description of logspace algorithms as programs that take as input some structured d...
87
Voted
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...
102
Voted
ICC
2007
IEEE
15 years 7 months ago
2007
IEEE
— Low-Density Parity-Check (LDPC) codes are usually decoded by running an iterative belief-propagation, or message-passing, algorithm over the factor graph of the code. The tradi...
84
Voted
ISAAC
2005
Springer
15 years 6 months ago
2005
Springer
Abstract We study an information-theoretic variant of the graph coloring problem in which the objective function to minimize is the entropy of the coloring. The minimum entropy of ...
110
Voted
COCOON
2003
Springer
15 years 5 months ago
2003
Springer
In this paper, we approach the quality of a greedy algorithm for the maximum weighted clique problem from the viewpoint of matroid theory. More precisely, we consider the clique c...