[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/conf/icalp/Bodlaender88>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Hans_L._Bodlaender>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1007%2F3-540-19488-6%5F110>
foaf:homepage <https://doi.org/10.1007/3-540-19488-6_110>
dc:identifier DBLP conf/icalp/Bodlaender88 (xsd:string)
dc:identifier DOI doi.org%2F10.1007%2F3-540-19488-6%5F110 (xsd:string)
dcterms:issued 1988 (xsd:gYear)
rdfs:label Dynamic Programming on Graphs with Bounded Treewidth. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Hans_L._Bodlaender>
swrc:pages 105-118 (xsd:string)
dcterms:partOf <https://dblp.l3s.de/d2r/resource/publications/conf/icalp/1988>
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/conf/icalp/Bodlaender88/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/conf/icalp/Bodlaender88>
rdfs:seeAlso <http://dblp.uni-trier.de/db/conf/icalp/icalp88.html#Bodlaender88>
rdfs:seeAlso <https://doi.org/10.1007/3-540-19488-6_110>
swrc:series <https://dblp.l3s.de/d2r/resource/conferences/icalp>
dc:subject Treewidth; partial k-trees; graph decision problems; restrictions of NP-complete problems; polynomial time algorithms; dynamic programming; local condition compositions (xsd:string)
dc:title Dynamic Programming on Graphs with Bounded Treewidth. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:InProceedings
rdf:type foaf:Document