Optimal covering of cacti by vertex-disjoint paths
- 29 July 1991
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 84 (2) , 179-197
- https://doi.org/10.1016/0304-3975(91)90159-y
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- On mapping processes to processors in distributed systemsInternational Journal of Parallel Programming, 1987
- 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
- Algorithm 447: efficient algorithms for graph manipulationCommunications of the ACM, 1973