Depth-first search and the vertex cover problem
- 23 July 1982
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 14 (5) , 233-235
- https://doi.org/10.1016/0020-0190(82)90022-9
Abstract
No abstract availableThis publication has 3 references indexed in Scilit:
- Maximum matchings and treesInformation Processing Letters, 1980
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972