"Largest Chordal and Interval Subgraphs Faster than $$2^n$$ 2 n."

Ivan Bliznets et al. (2016)

Details and statistics

DOI: 10.1007/S00453-015-0054-2

access: open

type: Journal Article

metadata version: 2019-10-19

a service of  Schloss Dagstuhl - Leibniz Center for Informatics