Fully dynamic maintenance of vertex cover
Authors:
- 1 January 1994
- book chapter
- Published by Springer Nature
- p. 99-111
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Fully dynamic algorithms for bin packing: Being (mostly) myopic helps1993
- Sparsification-a technique for speeding up dynamic graph algorithms1992
- Optimization, approximation, and complexity classesJournal of Computer and System Sciences, 1991
- Data Structures for On-Line Updating of Minimum Spanning Trees, with ApplicationsSIAM Journal on Computing, 1985
- A modification of the greedy algorithm for vertex coverInformation Processing Letters, 1983
- Depth-first search and the vertex cover problemInformation Processing Letters, 1982
- Reducibility among Combinatorial Problems1972