1933 search results - page 41 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
141
Voted
ICCAD
1995
IEEE
15 years 7 months ago
1995
IEEE
Implementing a built-in self-test by a "test per clock" scheme offers advantages concerning fault coverage, detection of delay faults, and test application time. Such a ...
157
click to vote
SWAT
1994
Springer
15 years 7 months ago
1994
Springer
A graph is distance-hereditary if and only if each cycle on five or more vertices has at least two crossing chords. We present linear time algorithms for the minimum r-dominating c...
119
Voted
ESA
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for gra...
160
Voted
ATAL
2005
Springer
15 years 9 months ago
2005
Springer
Reinforcement learning problems are commonly tackled with temporal difference methods, which use dynamic programming and statistical sampling to estimate the long-term value of ta...
132
click to vote
ESA
2006
Springer
15 years 7 months ago
2006
Springer
We consider the following vertex coloring problem. We are given an undirected graph G = (V, E), where each vertex v is associated with a penalty rejection cost rv. We need to choos...