A linear time algorithm for finding an optimal degree-bounded subtree of an edge-weighted tree.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/ipl/IyerP09
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/ipl/IyerP09
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/K._Viswanathan_Iyer
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/S._Prasanna
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1016%2Fj.ipl.2009.01.023
>
foaf:
homepage
<
https://doi.org/10.1016/j.ipl.2009.01.023
>
dc:
identifier
DBLP journals/ipl/IyerP09
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1016%2Fj.ipl.2009.01.023
(xsd:string)
dcterms:
issued
2009
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/ipl
>
rdfs:
label
A linear time algorithm for finding an optimal degree-bounded subtree of an edge-weighted tree.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/K._Viswanathan_Iyer
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/S._Prasanna
>
swrc:
number
11
(xsd:string)
swrc:
pages
560-562
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/ipl/IyerP09/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/ipl/IyerP09
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/ipl/ipl109.html#IyerP09
>
rdfs:
seeAlso
<
https://doi.org/10.1016/j.ipl.2009.01.023
>
dc:
title
A linear time algorithm for finding an optimal degree-bounded subtree of an edge-weighted tree.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
109
(xsd:string)