The Realization Problem for Euclidean Minimum Spanning Trees is NP-hard.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/compgeom/EadesW94
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/compgeom/EadesW94
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Peter_Eades
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Sue_Whitesides
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1145%2F177424.177507
>
foaf:
homepage
<
https://doi.org/10.1145/177424.177507
>
dc:
identifier
DBLP conf/compgeom/EadesW94
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1145%2F177424.177507
(xsd:string)
dcterms:
issued
1994
(xsd:gYear)
rdfs:
label
The Realization Problem for Euclidean Minimum Spanning Trees is NP-hard.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Peter_Eades
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Sue_Whitesides
>
swrc:
pages
49-56
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/compgeom/1994
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/compgeom/EadesW94/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/compgeom/EadesW94
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/compgeom/compgeom94.html#EadesW94
>
rdfs:
seeAlso
<
https://doi.org/10.1145/177424.177507
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/compgeom
>
dc:
subject
NP-hard, graph drawing, graph layout, spanning tree, tree
(xsd:string)
dc:
title
The Realization Problem for Euclidean Minimum Spanning Trees is NP-hard.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document