"I/O-efficient algorithms for graphs of bounded treewidth."

Anil Maheshwari, Norbert Zeh (2001)

Details and statistics

DOI:

access: closed

type: Conference or Workshop Paper

metadata version: 2012-12-07

a service of  Schloss Dagstuhl - Leibniz Center for Informatics