Finding Largest Subtrees and Smallest Supertrees.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/algorithmica/GuptaN98
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/algorithmica/GuptaN98
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Arvind_Gupta
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Naomi_Nishimura
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2FPL00009212
>
foaf:
homepage
<
https://doi.org/10.1007/PL00009212
>
dc:
identifier
DBLP journals/algorithmica/GuptaN98
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2FPL00009212
(xsd:string)
dcterms:
issued
1998
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/algorithmica
>
rdfs:
label
Finding Largest Subtrees and Smallest Supertrees.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Arvind_Gupta
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Naomi_Nishimura
>
swrc:
number
2
(xsd:string)
swrc:
pages
183-210
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/algorithmica/GuptaN98/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/algorithmica/GuptaN98
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica21.html#GuptaN98
>
rdfs:
seeAlso
<
https://doi.org/10.1007/PL00009212
>
dc:
title
Finding Largest Subtrees and Smallest Supertrees.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
21
(xsd:string)