Finding grid embeddings with bounded maximum edge length is NP-complete
Publication date
1985
Editors
Advisors
Supervisors
DOI
Document Type
Report
Metadata
Show full item recordCollections
License
Abstract
Keywords
Wiskunde en Informatica (WIIN), Mathematics, Informatica, Landbouwwetenschappen, Natuurwetenschappen, Ordered by external client
Citation
Bodlaender, H L 1985, Finding grid embeddings with bounded maximum edge length is NP-complete. vol. 85-18, RUU-CS edn, Unknown Publisher, Utrecht. < http://www.cs.uu.nl/research/techreps/RUU-CS-85-18.html >