"On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges."

Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh (2013)

Details and statistics

DOI: 10.1007/978-3-319-03898-8_21

access: closed

type: Conference or Workshop Paper

metadata version: 2017-10-30

a service of  Schloss Dagstuhl - Leibniz Center for Informatics