Finding biconnected componemts and computing tree functions in logarithmic parallel time
We propose a new algorithm for finding the blocks (biconnected components) of an undirected graph. A serial implementation runs in 0[n+m] time and space on a graph of n vertices and m edges. A parallel implmentation runs in 0[log n] time and 0[n+m] space using 0[n+m] processors on a concurrent-read,...
Gespeichert in:
| Veröffentlicht in: | 25th Annual Symposium onFoundations of Computer Science, 1984 S. 12 - 20 |
|---|---|
| Hauptverfasser: | , |
| Format: | Tagungsbericht |
| Sprache: | Englisch |
| Veröffentlicht: |
IEEE
1984
|
| Schlagworte: | |
| ISBN: | 081860591X, 9780818605918 |
| ISSN: | 0272-5428 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | We propose a new algorithm for finding the blocks (biconnected components) of an undirected graph. A serial implementation runs in 0[n+m] time and space on a graph of n vertices and m edges. A parallel implmentation runs in 0[log n] time and 0[n+m] space using 0[n+m] processors on a concurrent-read, concurrent-write parallel RAM. An alternative implementation runs in 0[n/sup 2/p] time and 0[n/sup 2/] space using any number p ⩽ n/sup 2/log/sup 2/-n of processors, on a concurrent-read, exclusive-write parallel RAM. The latter algorithm has optimal speedup, assuming an adjacency matrix representation of the input. A general algorithmic technique which simplifies and improve computation of various functions on tress is introduced. This technique typically requires 0(log n) time using 0(n) space on an exclusive-read exclusive-write parallel RAM. |
|---|---|
| AbstractList | We propose a new algorithm for finding the blocks (biconnected components) of an undirected graph. A serial implementation runs in 0[n+m] time and space on a graph of n vertices and m edges. A parallel implmentation runs in 0[log n] time and 0[n+m] space using 0[n+m] processors on a concurrent-read, concurrent-write parallel RAM. An alternative implementation runs in 0[n/sup 2/p] time and 0[n/sup 2/] space using any number p ⩽ n/sup 2/log/sup 2/-n of processors, on a concurrent-read, exclusive-write parallel RAM. The latter algorithm has optimal speedup, assuming an adjacency matrix representation of the input. A general algorithmic technique which simplifies and improve computation of various functions on tress is introduced. This technique typically requires 0(log n) time using 0(n) space on an exclusive-read exclusive-write parallel RAM. |
| Author | Vishkin, U. Tarjan, R.E. |
| Author_xml | – sequence: 1 givenname: R.E. surname: Tarjan fullname: Tarjan, R.E. organization: AT&T Bell Laboratories – sequence: 2 givenname: U. surname: Vishkin fullname: Vishkin, U. |
| BookMark | eNotkEFPhDAUhJu4Ji6rd-OpfwB8rxQoR0NETTbxsHvY26aU17UGCoHuwX8vBjOHyWQm32EitvGDJ8YeERJEKJ8PdXVIsFQyKTBTZX7DIlCocshKPG3YFkQh4kwKdceief4GkJBBumWn2vnW-QtvnBm8JxOo5WboxwXfh5lrv8Zr-BuFiYjbqzfBDX7mzvNuuOjJha_eGT7qSXcddTy4nu7ZrdXdTA__vmPH-vVYvcf7z7eP6mUfO1WG2KYoqBGCFqVWgpWlEtrIvBGI2kKx9LJQSLlE3RLlWoCxmW5awFYSpjv2tGIdEZ3HyfV6-jmvH6S_qclUCg |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.1109/SFCS.1984.715896 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Xplore POP ALL IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP All) 1998-Present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| EndPage | 20 |
| ExternalDocumentID | 715896 |
| GroupedDBID | -~X 23M 6IE 6IF 6IH 6IK 6IL 6IM 6IN AAJGR AAWTH ACNCT ADZIZ AFFNX AI. ALMA_UNASSIGNED_HOLDINGS BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK CHZPO IPLJI OCL RIE RIL RNS VH1 |
| ID | FETCH-LOGICAL-i89t-f312eb22e2e23f40f4982ac46b211af073124781e641adee6a20cf5abd01d4e13 |
| IEDL.DBID | RIE |
| ISBN | 081860591X 9780818605918 |
| ISSN | 0272-5428 |
| IngestDate | Tue Aug 26 17:12:25 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i89t-f312eb22e2e23f40f4982ac46b211af073124781e641adee6a20cf5abd01d4e13 |
| PageCount | 9 |
| ParticipantIDs | ieee_primary_715896 |
| PublicationCentury | 1900 |
| PublicationDate | 19840000 |
| PublicationDateYYYYMMDD | 1984-01-01 |
| PublicationDate_xml | – year: 1984 text: 19840000 |
| PublicationDecade | 1980 |
| PublicationTitle | 25th Annual Symposium onFoundations of Computer Science, 1984 |
| PublicationTitleAbbrev | SFCS |
| PublicationYear | 1984 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| SSID | ssj0040503 ssj0001968599 |
| Score | 1.1868207 |
| Snippet | We propose a new algorithm for finding the blocks (biconnected components) of an undirected graph. A serial implementation runs in 0[n+m] time and space on a... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 12 |
| SubjectTerms | Computational modeling Computer science Concurrent computing Parallel algorithms Phase change random access memory Random access memory Read-write memory Tree graphs US Department of Energy Writing |
| Title | Finding biconnected componemts and computing tree functions in logarithmic parallel time |
| URI | https://ieeexplore.ieee.org/document/715896 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3NT8IwFG-EeNALihi_04PXwT66rj0TFw9KSODAjazda1wCw8jw7_e1ZRATL2aXdmmypn173-_3CHlWITNpyZOAowAImNRJoAzXAZKHgszEwD1I0ls2mYjFQk73ONuuFgYAXPIZDO3QxfLLjd5ZV9koi1IheYd0soz7Uq2jO0VykVrN2jNhZmFOnHsls1D_sXDQj5FA5V1GLfBOOxdt-DKUo1k-ng3REGdD_7FfTVeczMl7_9rtBRkca_fo9CCVLskJ1H3Sa5s30P2_3Cfn7wfA1u0VWeSVK2-hCikDWa9GRZTadPNNDetmS4vaT3c2S5raSDa1EtERLa1qihwUje7mY11patHEVytYUdu3fkDm-ct8_Brsmy4ElZBNYJIoRmM7BnwSw0LDpIgLzbhCS7EwyBBQIchEBJxFRQnAizjUJi1UGUYlgyi5Jt0at3ZDKKClostCSlCK4QrFDMq-ApJYco166i3p20NbfnpYjaU_r7s_396TM3sp3vfxQLrN1w4eyan-bqrt15MjhR_YHK-g |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3NT8IwFG8UTdQLihi_7cHrYB-la89EghEICRy4kbV7jUtgGBj-_b52A2LixezSLk3WtG_v-_0eIa_KZ6aT8sjjKAA8JnXkKcO1h-ShIDYh8BIkaRCPRmI2k-MKZ9vVwgCASz6Dlh26WH660lvrKmvHQUdIfkxObOOsqljr4FCRXHSsbl2yYWaBTpyDJbZg_6Fw4I-BQPVdBjvond1c7AKYvmxPet1JC01x1io_96vtipM6vfq_9ntJmofqPTrey6UrcgR5g9R37Rto9Tc3yMVwD9m6uSazXuYKXKhC2kDmq1EVpTbhfJXDstjQJC-nW5snTW0sm1qZ6MiWZjlFHopmd_G5zDS1eOKLBSyo7VzfJNPe27Tb96q2C14mZOGZKAjR3A4Bn8gw3zApwkQzrtBWTAyyBFQJYhEAZ0GSAvAk9LXpJCr1g5RBEN2QWo5buyUU0FbRaSIlKMVwhWIGpV8CUSi5Rk31jjTsoc2_SmCNeXle93--fSFn_elwMB-8jz4eyLm9oNIT8khqxXoLT-RUfxfZZv3syOIHL3yy6Q |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=25th+Annual+Symposium+onFoundations+of+Computer+Science%2C+1984&rft.atitle=Finding+biconnected+componemts+and+computing+tree+functions+in+logarithmic+parallel+time&rft.au=Tarjan%2C+R.E.&rft.au=Vishkin%2C+U.&rft.date=1984-01-01&rft.pub=IEEE&rft.isbn=9780818605918&rft.issn=0272-5428&rft.spage=12&rft.epage=20&rft_id=info:doi/10.1109%2FSFCS.1984.715896&rft.externalDocID=715896 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0272-5428&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0272-5428&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0272-5428&client=summon |