2 search results - page 1 / 1 » Quasi-Fully Dynamic Algorithms for Two-Connectivity, Cycle E... |
ESA
1997
Springer
14 years 11 months ago
1997
Springer
In thispaper we introduce a new class of dynamicgraphalgorithmscalledquasi-fully dynamic algorithms,which are much more general than the backtracking algorithmsand are much simple...
IWOCA
2009
Springer
15 years 1 months ago
2009
Springer
The Feedback Vertex Set problem asks whether a graph contains q vertices meeting all its cycles. This is not a local property, in the sense that we cannot check if q vertices meet...