871 search results - page 41 / 175 » The vertex-cover polynomial of a graph |
105
click to vote
TRIER
2002
14 years 9 months ago
2002
Constant propagation aims at identifying expressions that always yield a unique constant value at run-time. It is well-known that constant propagation is undecidable for programs w...
100
click to vote
CPC
2006
14 years 9 months ago
2006
We consider instances of the maximum independent set problem that are constructed according to the following semirandom model. Let Gn,p be a random graph, and let S be a set consis...
CORR
2002
Springer
14 years 9 months ago
2002
Springer
Dealing with the NP-complete Dominating Set problem on graphs, we demonstrate the power of data reduction by preprocessing from a theoretical as well as a practical side. In parti...
IPL
2010
14 years 7 months ago
2010
Polynomial algorithms are given for the following two problems:
COCOON
2005
Springer
15 years 3 months ago
2005
Springer
We consider the problem of finding a balanced ordering of the vertices of a graph. More precisely, we want to minimise the sum, taken over all vertices v, of the difference betwe...