288 search results - page 35 / 58 » On the number of maximal independent sets in a graph |
107
click to vote
ICCS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. In knowledge bases, the open world assumption and the ability to express variables may lead to an answer redundancy problem. This problem occurs when the returned answers...
APPROX
2011
Springer
13 years 9 months ago
2011
Springer
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
APPROX
2010
Springer
14 years 11 months ago
2010
Springer
Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well-studied push model. Assu...
FSTTCS
2009
Springer
15 years 4 months ago
2009
Springer
We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theor...
GECCO
2007
Springer
15 years 1 months ago
2007
Springer
Studying metabolic fluxes is a crucial aspect of understanding biological phenotypes. However, it is often not possible to measure these fluxes directly. As an alternative, fluxom...