Finding grid embeddings with bounded maximum edge length is NP-complete

Research output: Book/Report › Report › Academic

1 Downloads (Pure)

Keywords

@book{d5464e6a1ea84d21b6ac91c5d3d0320a,

title = "Finding grid embeddings with bounded maximum edge length is NP-complete",

keywords = "Wiskunde en Informatica (WIIN), Mathematics, Informatica, Landbouwwetenschappen, Natuurwetenschappen",

author = "H.L. Bodlaender",

year = "1985",

language = "Undefined/Unknown",

isbn = "0924-3275",

volume = "85-18",

publisher = "Unknown Publisher",

edition = "RUU-CS",

}

TY - BOOK

T1 - Finding grid embeddings with bounded maximum edge length is NP-complete

AU - Bodlaender, H.L.

PY - 1985

Y1 - 1985

KW - Wiskunde en Informatica (WIIN)

KW - Mathematics

KW - Informatica

KW - Landbouwwetenschappen

KW - Natuurwetenschappen

M3 - Report

SN - 0924-3275

VL - 85-18

BT - Finding grid embeddings with bounded maximum edge length is NP-complete

PB - Unknown Publisher

CY - Utrecht

ER -