"NP-completeness of some problems of partitioning and covering in graphs."

Bernard Péroche (1984)

Details and statistics

DOI: 10.1016/0166-218X(84)90101-X

access: open

type: Journal Article

metadata version: 2021-02-11

a service of  Schloss Dagstuhl - Leibniz Center for Informatics