Academic Journal
An efficient parallel biconnectivity algorithm
| Τίτλος: | An efficient parallel biconnectivity algorithm |
|---|---|
| Συγγραφείς: | Robert E. Tarjan |
| Συνεισφορές: | The Pennsylvania State University CiteSeerX Archives |
| Πηγή: | http://www.umiacs.umd.edu/users/vishkin/TEACHING/ENEE759KS12/TV85.pdf. |
| Έτος έκδοσης: | 1985 |
| Συλλογή: | CiteSeerX |
| Θεματικοί όροι: | Key words, parallel graph algorithm, biconnected components, blocks |
| Περιγραφή: | In this paper we propose a new algorithm for finding the blocks (biconnected components) of an undirected graph. A serial implementation runs in O(n + m) time and space on a graph of n vertices and m edges. A parallel implementation runs in O(log n) time and O(n + m) space using O(n + m) processors on a concurrent-read, concurrent-write parallel RAM. An alternative implementation runs in O(n2/p) time and O(n2) space using any number p < = n/log n of processors, on a concurrent-read, exclusive-write parallel RAM. The last algorithm has optimal speedup, assuming an adjacency matrix representation of the input. A general algorithmic technique that simplifies and improves computation of various functions on trees is introduced. This technique typically requires O(log n) time using processors and O(n) space on an exclusive-read exclusive-write parallel RAM. |
| Τύπος εγγράφου: | text |
| Περιγραφή αρχείου: | application/pdf |
| Γλώσσα: | English |
| Relation: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.465.8898; http://www.umiacs.umd.edu/users/vishkin/TEACHING/ENEE759KS12/TV85.pdf |
| Διαθεσιμότητα: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.465.8898 http://www.umiacs.umd.edu/users/vishkin/TEACHING/ENEE759KS12/TV85.pdf |
| Rights: | Metadata may be used without restrictions as long as the oai identifier remains attached to it. |
| Αριθμός Καταχώρησης: | edsbas.CAD08B9 |
| Βάση Δεδομένων: | BASE |
| FullText | Text: Availability: 0 CustomLinks: – Url: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.465.8898# Name: EDS - BASE (ns324271) Category: fullText Text: View record from BASE |
|---|---|
| Header | DbId: edsbas DbLabel: BASE An: edsbas.CAD08B9 RelevancyScore: 753 AccessLevel: 3 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 753.149658203125 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: An efficient parallel biconnectivity algorithm – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Robert+E%2E+Tarjan%22">Robert E. Tarjan</searchLink> – Name: Author Label: Contributors Group: Au Data: The Pennsylvania State University CiteSeerX Archives – Name: TitleSource Label: Source Group: Src Data: <i>http://www.umiacs.umd.edu/users/vishkin/TEACHING/ENEE759KS12/TV85.pdf</i>. – Name: DatePubCY Label: Publication Year Group: Date Data: 1985 – Name: Subset Label: Collection Group: HoldingsInfo Data: CiteSeerX – Name: Subject Label: Subject Terms Group: Su Data: <searchLink fieldCode="DE" term="%22Key+words%22">Key words</searchLink><br /><searchLink fieldCode="DE" term="%22parallel+graph+algorithm%22">parallel graph algorithm</searchLink><br /><searchLink fieldCode="DE" term="%22biconnected+components%22">biconnected components</searchLink><br /><searchLink fieldCode="DE" term="%22blocks%22">blocks</searchLink> – Name: Abstract Label: Description Group: Ab Data: In this paper we propose a new algorithm for finding the blocks (biconnected components) of an undirected graph. A serial implementation runs in O(n + m) time and space on a graph of n vertices and m edges. A parallel implementation runs in O(log n) time and O(n + m) space using O(n + m) processors on a concurrent-read, concurrent-write parallel RAM. An alternative implementation runs in O(n2/p) time and O(n2) space using any number p < = n/log n of processors, on a concurrent-read, exclusive-write parallel RAM. The last algorithm has optimal speedup, assuming an adjacency matrix representation of the input. A general algorithmic technique that simplifies and improves computation of various functions on trees is introduced. This technique typically requires O(log n) time using processors and O(n) space on an exclusive-read exclusive-write parallel RAM. – 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.465.8898; http://www.umiacs.umd.edu/users/vishkin/TEACHING/ENEE759KS12/TV85.pdf – Name: URL Label: Availability Group: URL Data: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.465.8898<br />http://www.umiacs.umd.edu/users/vishkin/TEACHING/ENEE759KS12/TV85.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.CAD08B9 |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsbas&AN=edsbas.CAD08B9 |
| RecordInfo | BibRecord: BibEntity: Languages: – Text: English Subjects: – SubjectFull: Key words Type: general – SubjectFull: parallel graph algorithm Type: general – SubjectFull: biconnected components Type: general – SubjectFull: blocks Type: general Titles: – TitleFull: An efficient parallel biconnectivity algorithm Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Robert E. Tarjan – PersonEntity: Name: NameFull: The Pennsylvania State University CiteSeerX Archives IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 01 Type: published Y: 1985 Identifiers: – Type: issn-locals Value: edsbas – Type: issn-locals Value: edsbas.oa Titles: – TitleFull: http://www.umiacs.umd.edu/users/vishkin/TEACHING/ENEE759KS12/TV85.pdf Type: main |
| ResultId | 1 |