[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/journals/tjs/Datta02>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Amitava_Datta>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1023%2FA%3A1016552512787>
foaf:homepage <https://doi.org/10.1023/A:1016552512787>
dc:identifier DBLP journals/tjs/Datta02 (xsd:string)
dc:identifier DOI doi.org%2F10.1023%2FA%3A1016552512787 (xsd:string)
dcterms:issued 2002 (xsd:gYear)
swrc:journal <https://dblp.l3s.de/d2r/resource/journals/tjs>
rdfs:label Efficient Graph-Theoretic Algorithms on a Linear Array with a Reconfigurable Pipelined Bus System. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Amitava_Datta>
swrc:number 2 (xsd:string)
swrc:pages 193-211 (xsd:string)
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/journals/tjs/Datta02/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/journals/tjs/Datta02>
rdfs:seeAlso <http://dblp.uni-trier.de/db/journals/tjs/tjs23.html#Datta02>
rdfs:seeAlso <https://doi.org/10.1023/A:1016552512787>
dc:subject parallel algorithm; optical computing; reconfigurable pipelined bus; graph algorithms; connected components; minimum spanning forest; biconnected components (xsd:string)
dc:title Efficient Graph-Theoretic Algorithms on a Linear Array with a Reconfigurable Pipelined Bus System. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:Article
rdf:type foaf:Document
swrc:volume 23 (xsd:string)