[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/journals/tse/MishraRT91>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Nian-Feng_Tzeng>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Subhada_K._Mishra>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Vijay_V._Raghavan_0001>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1109%2F32.83909>
foaf:homepage <https://doi.org/10.1109/32.83909>
dc:identifier DBLP journals/tse/MishraRT91 (xsd:string)
dc:identifier DOI doi.org%2F10.1109%2F32.83909 (xsd:string)
dcterms:issued 1991 (xsd:gYear)
swrc:journal <https://dblp.l3s.de/d2r/resource/journals/tse>
rdfs:label Efficient Algorithms For Selection of Recovery Points in Tree Task Models. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Nian-Feng_Tzeng>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Subhada_K._Mishra>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Vijay_V._Raghavan_0001>
swrc:number 7 (xsd:string)
swrc:pages 731-734 (xsd:string)
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/journals/tse/MishraRT91/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/journals/tse/MishraRT91>
rdfs:seeAlso <http://dblp.uni-trier.de/db/journals/tse/tse17.html#MishraRT91>
rdfs:seeAlso <https://doi.org/10.1109/32.83909>
dc:subject tree task models; recovery points; task precedence; tree structure; uniprocessor environment; binary tree model; time complexity; exponential time requirements; arbitrary tree model; computational complexity; optimisation; trees (mathematics) (xsd:string)
dc:title Efficient Algorithms For Selection of Recovery Points in Tree Task Models. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:Article
rdf:type foaf:Document
swrc:volume 17 (xsd:string)