Academic Journal
Προβολή σε EDS

A randomized linear work EREW PRAM algorithm to find a minimum spanning forest

Λεπτομέρειες βιβλιογραφικής εγγραφής
Τίτλος: A randomized linear work EREW PRAM algorithm to find a minimum spanning forest
Συγγραφείς: Chung Keung Poon, Vijaya Ramachandran
Συνεισφορές: The Pennsylvania State University CiteSeerX Archives
Πηγή: http://www.cs.utexas.edu/~vlr/papers/mst97.pdf.
Στοιχεία εκδότη: Springer-Verlag
Έτος έκδοσης: 1997
Συλλογή: CiteSeerX
Περιγραφή: We present a randomized EREW PRAM algorithm to nd a minimum spanning forest in a weighted undirected graph. On an nvertex graph the algorithm runs in o((log n) 1+) expected time for any >0 and performs linear expected work. This is the rst linear work, polylog time algorithm on the EREW PRAM for this problem. This also gives parallel algorithms that perform expected linear work on two general-purpose models of parallel computation -- the QSM and the BSP.
Τύπος εγγράφου: text
Περιγραφή αρχείου: application/pdf
Γλώσσα: English
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.63.514; http://www.cs.utexas.edu/~vlr/papers/mst97.pdf
Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.63.514
http://www.cs.utexas.edu/~vlr/papers/mst97.pdf
Rights: Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Αριθμός Καταχώρησης: edsbas.BDF0AF15
Βάση Δεδομένων: BASE
FullText Text:
  Availability: 0
CustomLinks:
  – Url: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.63.514#
    Name: EDS - BASE (ns324271)
    Category: fullText
    Text: View record from BASE
Header DbId: edsbas
DbLabel: BASE
An: edsbas.BDF0AF15
RelevancyScore: 822
AccessLevel: 3
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 822.459594726563
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: A randomized linear work EREW PRAM algorithm to find a minimum spanning forest
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Chung+Keung+Poon%22">Chung Keung Poon</searchLink><br /><searchLink fieldCode="AR" term="%22Vijaya+Ramachandran%22">Vijaya Ramachandran</searchLink>
– Name: Author
  Label: Contributors
  Group: Au
  Data: The Pennsylvania State University CiteSeerX Archives
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <i>http://www.cs.utexas.edu/~vlr/papers/mst97.pdf</i>.
– Name: Publisher
  Label: Publisher Information
  Group: PubInfo
  Data: Springer-Verlag
– Name: DatePubCY
  Label: Publication Year
  Group: Date
  Data: 1997
– Name: Subset
  Label: Collection
  Group: HoldingsInfo
  Data: CiteSeerX
– Name: Abstract
  Label: Description
  Group: Ab
  Data: We present a randomized EREW PRAM algorithm to nd a minimum spanning forest in a weighted undirected graph. On an nvertex graph the algorithm runs in o((log n) 1+) expected time for any >0 and performs linear expected work. This is the rst linear work, polylog time algorithm on the EREW PRAM for this problem. This also gives parallel algorithms that perform expected linear work on two general-purpose models of parallel computation -- the QSM and the BSP.
– Name: TypeDocument
  Label: Document Type
  Group: TypDoc
  Data: text
– Name: Format
  Label: File Description
  Group: SrcInfo
  Data: application/pdf
– Name: Language
  Label: Language
  Group: Lang
  Data: English
– Name: NoteTitleSource
  Label: Relation
  Group: SrcInfo
  Data: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.63.514; http://www.cs.utexas.edu/~vlr/papers/mst97.pdf
– Name: URL
  Label: Availability
  Group: URL
  Data: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.63.514<br />http://www.cs.utexas.edu/~vlr/papers/mst97.pdf
– Name: Copyright
  Label: Rights
  Group: Cpyrght
  Data: Metadata may be used without restrictions as long as the oai identifier remains attached to it.
– Name: AN
  Label: Accession Number
  Group: ID
  Data: edsbas.BDF0AF15
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsbas&AN=edsbas.BDF0AF15
RecordInfo BibRecord:
  BibEntity:
    Languages:
      – Text: English
    Titles:
      – TitleFull: A randomized linear work EREW PRAM algorithm to find a minimum spanning forest
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Chung Keung Poon
      – PersonEntity:
          Name:
            NameFull: Vijaya Ramachandran
      – PersonEntity:
          Name:
            NameFull: The Pennsylvania State University CiteSeerX Archives
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Type: published
              Y: 1997
          Identifiers:
            – Type: issn-locals
              Value: edsbas
            – Type: issn-locals
              Value: edsbas.oa
          Titles:
            – TitleFull: http://www.cs.utexas.edu/~vlr/papers/mst97.pdf
              Type: main
ResultId 1