Approximation algorithms for covering a graph by vertex‐disjoint paths of maximum total weight
- 1 January 1990
- Vol. 20 (1), 55-64
- https://doi.org/10.1002/net.3230200106
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- On mapping processes to processors in distributed systemsInternational Journal of Parallel Programming, 1987
- Efficient algorithms for finding maximum matching in graphsACM Computing Surveys, 1986
- Efficient Implementation Of Graph Algorithms Using ContractionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1984
- Another look at the degree constrained subgraph problemInformation Processing Letters, 1981
- Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code OptimizationJournal of the ACM, 1977
- The Planar Hamiltonian Circuit Problem is NP-CompleteSIAM Journal on Computing, 1976