|
rdfs:label
|
"Algorithms for graphs embeddable with few crossings per edge / Hans L. Bodlaender, Alexander Grigoriev"
|
|
schema:name
|
"Algorithms for graphs embeddable with few crossings per edge"
|
|
schema:author
|
Bodlaender, Hans Leo (1960-)
|
|
Maastricht research school of Economics of Technology and Organizations
|
|
schema:contributor
|
Grigoriev, Alexander (1971-)
|
|
schema:description
|
"Ook verschenen als on line resource"
|
|
schema:sameAs
|
<http://www.worldcat.org/oclc/66626032>
|
|
schema:mainEntityOfPage
|
<https://data.bibliotheken.nl/.well-known/genid/2cbb0b396109b83f95453fa15da95ce0>
|
|
kbdef:hasDerivative
|
Algorithms for graphs embeddable with few crossings per edge / Hans L. Bodlaender, Alexander Grigoriev
|
|
http://purl.org/dc/terms#issued
|
"2004"
|
|
schema:about
|
Mathematische programmering
|
|
algoritmen
|
|
Algorithms
|
|
Grafen
|
|
grafentheorie
|
|
<http://data.bibliotheken.nl/id/thes/p077605179>
|
|
Complexity
|
|
schema:inLanguage
|
"en"
|
|
schema:isPartOf
|
Research memorandum / METEOR
|
|
schema:numberOfPages
|
4
|
|
schema:publication
|
<https://data.bibliotheken.nl/.well-known/genid/de06be24c410b65f6bb677b0fee8b8e5>
|