Near-Optimal Bounded-Degree Spanning Trees.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/algorithmica/HansenS01
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/algorithmica/HansenS01
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Eric_Schmutz
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Jennie_C._Hansen
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2FBF02679617
>
foaf:
homepage
<
https://doi.org/10.1007/BF02679617
>
dc:
identifier
DBLP journals/algorithmica/HansenS01
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2FBF02679617
(xsd:string)
dcterms:
issued
2001
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/algorithmica
>
rdfs:
label
Near-Optimal Bounded-Degree Spanning Trees.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Eric_Schmutz
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Jennie_C._Hansen
>
swrc:
number
1
(xsd:string)
swrc:
pages
148-180
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/algorithmica/HansenS01/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/algorithmica/HansenS01
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica29.html#HansenS01
>
rdfs:
seeAlso
<
https://doi.org/10.1007/BF02679617
>
dc:
subject
Data structures, Search trees, AVL trees, Relaxed balance, Amortized analysis.
(xsd:string)
dc:
title
Near-Optimal Bounded-Degree Spanning Trees.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
29
(xsd:string)