278 search results - page 20 / 56 » Two Upper Bounds on the Chromatic Number |
BMCBI
2007
13 years 8 months ago
2007
Background: Multiple sequence alignment is fundamental. Exponential growth in computation time appears to be inevitable when an optimal alignment is required for many sequences. E...
ICALP
2007
Springer
14 years 2 months ago
2007
Springer
This paper studies labeling schemes for the vertex connectivity function on general graphs. We consider the problem of labeling the nodes of any n-node graph is such a way that gi...
ICC
2009
IEEE
13 years 6 months ago
2009
IEEE
Abstract--We present and analyze two different power allocation strategies for considerably improving the average bit error rate (BER) performance of wireless multihop systems with...
PODC
2006
ACM
14 years 2 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
ALGORITHMICA
2008
13 years 8 months ago
2008
In this paper we consider the following question: how many vertices of the discrete torus must be deleted so that no topologically nontrivial cycles remain? We look at two differe...