A short note on the use of the red-black tree in Cartesian adaptive mesh refinement algorithms.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/jcphy/HasbestanS17
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/jcphy/HasbestanS17
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Inanc_Senocak
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Jaber_J._Hasbestan
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1016%2Fj.jcp.2017.09.056
>
foaf:
homepage
<
https://doi.org/10.1016/j.jcp.2017.09.056
>
dc:
identifier
DBLP journals/jcphy/HasbestanS17
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1016%2Fj.jcp.2017.09.056
(xsd:string)
dcterms:
issued
2017
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/jcphy
>
rdfs:
label
A short note on the use of the red-black tree in Cartesian adaptive mesh refinement algorithms.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Inanc_Senocak
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Jaber_J._Hasbestan
>
swrc:
pages
473-477
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/jcphy/HasbestanS17/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/jcphy/HasbestanS17
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/jcphy/jcphy351.html#HasbestanS17
>
rdfs:
seeAlso
<
https://doi.org/10.1016/j.jcp.2017.09.056
>
dc:
title
A short note on the use of the red-black tree in Cartesian adaptive mesh refinement algorithms.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
351
(xsd:string)