A New Algorithm for Finding Trees with Many Leaves.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/isaac/KneisLR08
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/isaac/KneisLR08
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Alexander_Langer
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Joachim_Kneis
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Peter_Rossmanith
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2F978-3-540-92182-0%5F26
>
foaf:
homepage
<
https://doi.org/10.1007/978-3-540-92182-0_26
>
dc:
identifier
DBLP conf/isaac/KneisLR08
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2F978-3-540-92182-0%5F26
(xsd:string)
dcterms:
issued
2008
(xsd:gYear)
rdfs:
label
A New Algorithm for Finding Trees with Many Leaves.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Alexander_Langer
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Joachim_Kneis
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Peter_Rossmanith
>
swrc:
pages
270-281
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/isaac/2008
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/isaac/KneisLR08/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/isaac/KneisLR08
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/isaac/isaac2008.html#KneisLR08
>
rdfs:
seeAlso
<
https://doi.org/10.1007/978-3-540-92182-0_26
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/isaac
>
dc:
title
A New Algorithm for Finding Trees with Many Leaves.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document