Show simple item record

dc.contributor.authorShen, Hong
dc.date.accessioned2017-05-03T13:45:37Z
dc.date.available2017-05-03T13:45:37Z
dc.date.issued2000
dc.date.modified2007-03-13T21:51:13Z
dc.identifier.issn00207160
dc.identifier.doi10.1080/00207160008804971
dc.identifier.urihttp://hdl.handle.net/10072/3226
dc.description.peerreviewedYes
dc.description.publicationstatusYes
dc.languageEnglish
dc.language.isoeng
dc.publisherTaylor & Francis
dc.publisher.placeUK
dc.relation.ispartofpagefrom129
dc.relation.ispartofpageto136
dc.relation.ispartofjournalInternational Journal of Computer Mathematics
dc.relation.ispartofvolume75
dc.subject.fieldofresearchHistory and Archaeology
dc.subject.fieldofresearchApplied Mathematics
dc.subject.fieldofresearchComputation Theory and Mathematics
dc.subject.fieldofresearchcode21
dc.subject.fieldofresearchcode0102
dc.subject.fieldofresearchcode0802
dc.titleImproved parallel algorithms for finding the most vital edge of a graph with respect to minimum spanning tree
dc.typeJournal article
dc.type.descriptionC1 - Articles
dc.type.codeC - Journal Articles
gro.rights.copyright© 2000 Taylor & Francis : The author-version of this article will be available for download [12-18 months] after publication : Use hypertext link to access the version of the publisher.
gro.date.issued2000
gro.hasfulltextNo Full Text
gro.griffith.authorShen, Hong


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

  • Journal articles
    Contains articles published by Griffith authors in scholarly journals.

Show simple item record