"On Improved Time Bounds for Permutation Graph Problems."

Andreas Brandstädt (1992)

Details and statistics

DOI: 10.1007/3-540-56402-0_30

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-20

a service of  Schloss Dagstuhl - Leibniz Center for Informatics