Algorithms for graphs embeddable with few crossings per edge / Hans L. Bodlaender, Alexander Grigoriev

<http://data.bibliotheken.nl/id/nbt/p268021198>

schema:ProductModel schema:CreativeWork schema:Book
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 <https://data.bibliotheken.nl/.well-known/genid/2432405581a03ea6842a98df66086283>
schema:contributor <https://data.bibliotheken.nl/.well-known/genid/e6ca463eed61e888a1407e7a0306c879>
schema:mainEntityOfPage <https://data.bibliotheken.nl/.well-known/genid/b9070857bc55e205f6cdeda1bc6d97be>
http://purl.org/dc/terms#issued "2004"
schema:about Mathematical programming
Grafen
Algorithms
Complexity
<http://data.bibliotheken.nl/id/thes/p077605179>
schema:associatedMedia <http://digitalarchive.maastrichtuniversity.nl/fedora/get/guid:dfa150f5-366c-4fed-a557-d7e7e7d3e75f/ASSET1>
schema:bookFormat schema:EBook
schema:inLanguage "en"
schema:isBasedOn Algorithms for graphs embeddable with few crossings per edge / Hans L. Bodlaender, Alexander Grigoriev
schema:isPartOf METEOR research memorandum
schema:numberOfPages 0
schema:publication <https://data.bibliotheken.nl/.well-known/genid/7c8fd3f1a1cead8cae907eee2e55eaf1>

Inverse relations

[ .. ] → kbdef:hasDerivative → Algorithms for graphs embeddable with few crossings per edge / Hans L. Bodlaender, Alexander Grigoriev

Algorithms for graphs embeddable with few crossings per edge / Hans L. Bodlaender, Alexander Grigorievschema:ProductModel
Download as:
RDF/XML JSON-LD Turtle
data from SPARQL endpoint: https://api.bibliotheken.nl/datasets/KB/Production/services/Production-VTS/sparql