[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/conf/stacs/Tantau04>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Till_Tantau>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1007%2F978-3-540-24749-4%5F29>
foaf:homepage <https://doi.org/10.1007/978-3-540-24749-4_29>
dc:identifier DBLP conf/stacs/Tantau04 (xsd:string)
dc:identifier DOI doi.org%2F10.1007%2F978-3-540-24749-4%5F29 (xsd:string)
dcterms:issued 2004 (xsd:gYear)
rdfs:label A Logspace Approximation Scheme for the Shortest Path Problem for Graphs with Bounded Independence Number. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Till_Tantau>
swrc:pages 326-337 (xsd:string)
dcterms:partOf <https://dblp.l3s.de/d2r/resource/publications/conf/stacs/2004>
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/conf/stacs/Tantau04/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/conf/stacs/Tantau04>
rdfs:seeAlso <http://dblp.uni-trier.de/db/conf/stacs/stacs2004.html#Tantau04>
rdfs:seeAlso <https://doi.org/10.1007/978-3-540-24749-4_29>
swrc:series <https://dblp.l3s.de/d2r/resource/conferences/stacs>
dc:title A Logspace Approximation Scheme for the Shortest Path Problem for Graphs with Bounded Independence Number. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:InProceedings
rdf:type foaf:Document