"Perfect graphs are kernel solvable."

Endre Boros, Vladimir Gurvich (1996)

Details and statistics

DOI: 10.1016/0012-365X(95)00096-F

access: open

type: Journal Article

metadata version: 2021-02-12

a service of  Schloss Dagstuhl - Leibniz Center for Informatics