scientific article; zbMATH DE number 3929052

MaRDI QIDQ3703928zbMATH OpenFDO

Authors A. M. Kochkarov

Publication date 1985

zbMATH Keywords

algorithmsPath coverings

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 4099071
• Approximation algorithms for covering a graph by vertex-disjoint paths of maximum total weight
• scientific article; zbMATH DE number 792650
• scientific article; zbMATH DE number 1748022
• scientific article; zbMATH DE number 1837688

Cited in

(10)

• Path covering problems and testing of printed circuits
• An optimal path cover algorithm for cographs
• On the asymptotic optimality of a solution of the Euclidean problem of covering a graph by \(m\) nonadjacent cycles of maximum total weight
• Approximation algorithms for covering a graph by vertex-disjoint paths of maximum total weight
• The paths with local restrictions
• Chemins extrémaux d'un graphe doublement valué
• Exact and approximate algorithms for movement problems on (special classes of) graphs
• scientific article; zbMATH DE number 4170668 (Why is no real title available?)
• scientific article; zbMATH DE number 892042 (Why is no real title available?)
• Multicriteria path and tree problems: discussion on exact algorithms and applications

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3703928)