Graph covering via shortest paths

MaRDI QIDQ5443196zbMATH OpenFDO

Authors Peter Boothe, Zdeněk Dvořák, Arthur M. Farley, Andrzej Proskurowski

Publication date 20 February 2008

zbMATH Keywords

NP-completeshortest pathvertex covers

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Identifying path covers in graphs
• scientific article; zbMATH DE number 1236360
• Efficient Algorithms for Solving the Shortest Covering Path Problem
• On Graph Identification Problems and the Special Case of Identifying Vertices Using Paths
• scientific article; zbMATH DE number 1919454

Cited in

(6)

• An optimal path cover algorithm for cographs
• Strong edge geodetic problem in networks
• The geodesic transversal problem on some networks
• Loose cover of graphs by a local structure
• scientific article; zbMATH DE number 2112440 (Why is no real title available?)
• Loose cover of graphs

This page was built for publication: Graph covering via shortest paths

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