"Computing Tree-depth Faster Than 2n."

Fedor V. Fomin, Archontia C. Giannopoulou, Michal Pilipczuk (2013)

Details and statistics

DOI:

access: open

type: Informal or Other Publication

metadata version: 2018-08-13

a service of  Schloss Dagstuhl - Leibniz Center for Informatics