Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/jda/KanetaAR12
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/jda/KanetaAR12
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Hiroki_Arimura
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Rajeev_Raman
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Yusaku_Kaneta
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1016%2Fj.jda.2011.12.018
>
foaf:
homepage
<
https://doi.org/10.1016/j.jda.2011.12.018
>
dc:
identifier
DBLP journals/jda/KanetaAR12
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1016%2Fj.jda.2011.12.018
(xsd:string)
dcterms:
issued
2012
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/jda
>
rdfs:
label
Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Hiroki_Arimura
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Rajeev_Raman
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Yusaku_Kaneta
>
swrc:
pages
119-135
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/jda/KanetaAR12/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/jda/KanetaAR12
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/jda/jda14.html#KanetaAR12
>
rdfs:
seeAlso
<
https://doi.org/10.1016/j.jda.2011.12.018
>
dc:
title
Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
14
(xsd:string)