Views provided by UsageCounts
An exact vertex cover solver was implemented in C++. It is based on a simple search tree algorithm, extended with multiple reduction rules and lower bounds. The former include some standard ruleslike the degree one and unconfined vertex rule, but also rather new ones such as clique neighbourhoodand degree three. The lower bounds consist of a clique cover heuristic and one based on integerprogramming. About 40 out of 100 PACE test instances could be solved.
fixed parameter tractability, exact algorithm, vertex cover
fixed parameter tractability, exact algorithm, vertex cover
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
| views | 4 |

Views provided by UsageCounts