On computational complexity of length embeddability of graphs. | D2R Server publishing the DBLP Bibliography Database, hosted at L3S Research Center

Property	Value
dcterms:bibliographicCitation	<http://dblp.uni-trier.de/rec/bibtex/journals/dm/Tikhomirov16>
dc:creator	<https://dblp.l3s.de/d2r/resource/authors/Mikhail_Tikhomirov>
foaf:homepage	<http://dx.doi.org/doi.org%2F10.1016%2Fj.disc.2016.05.011>
foaf:homepage	<https://doi.org/10.1016/j.disc.2016.05.011>
dc:identifier	DBLP journals/dm/Tikhomirov16 (xsd:string)
dc:identifier	DOI doi.org%2F10.1016%2Fj.disc.2016.05.011 (xsd:string)
dcterms:issued	2016 (xsd:gYear)
swrc:journal	<https://dblp.l3s.de/d2r/resource/journals/dm>
rdfs:label	On computational complexity of length embeddability of graphs. (xsd:string)
foaf:maker	<https://dblp.l3s.de/d2r/resource/authors/Mikhail_Tikhomirov>
swrc:number	11 (xsd:string)
swrc:pages	2605-2612 (xsd:string)
owl:sameAs	<http://bibsonomy.org/uri/bibtexkey/journals/dm/Tikhomirov16/dblp>
owl:sameAs	<http://dblp.rkbexplorer.com/id/journals/dm/Tikhomirov16>
rdfs:seeAlso	<http://dblp.uni-trier.de/db/journals/dm/dm339.html#Tikhomirov16>
rdfs:seeAlso	<https://doi.org/10.1016/j.disc.2016.05.011>
dc:title	On computational complexity of length embeddability of graphs. (xsd:string)
dc:type	<http://purl.org/dc/dcmitype/Text>
rdf:type	swrc:Article
rdf:type	foaf:Document
swrc:volume	339 (xsd:string)