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,...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:25th Annual Symposium onFoundations of Computer Science, 1984 s. 12 - 20
Hlavní autoři: Tarjan, R.E., Vishkin, U.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 1984
Témata:
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
ISBN:081860591X, 9780818605918
ISSN:0272-5428
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
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_04PXwdp1XXsmLh6UkEAMN9J1r3EJDMOGf79txyAmXswuay9t2tf3_X4PoWctGMtFzgIKGQsY1XEghVFByB18uuQUfP-Uj7dkMhGLhZzucbZ9LQwA-OQzGLpfH8vPN3rnXGWjhMRC8g7qJAlvSrWO7hTJRew064YJMwdz4t0riYP6p8JDPxJhlXdJWuCddiza8GUoR7N0PBtaQ5wNm8V-NV3xMift_Wu3F2hwrN3D04NUukQnUPZRr23egPdvuY_O3w-ArdUVWqSFL2_BmaUMy3q1VUSxSzfflLCuK6zKZrhzWdLYRbKxk4ieaHFRYstBrdFdf64LjR2a-GoFK-z61g_QPH2Zj1-DfdOFoBCyDkxE7K1RCvaLDAsNk4IqzXhmLUVlLEOwCkEiCHBGVA7AFQ21iVWWhyRnQKJr1C3t1m4QjqW2lnpuuIwpExmoDECFRggdcqMjfYv67tCWXw2sxrI5r7s_Z-_RmbuUxvfxgLr1dgeP6FR_10W1ffKk8ANGjq_c
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3NT8IwFG8UTdQLihq_7cHrYOu6rj0TF4xASCCGG-m617gEhoHh32_bMYiJF7PL2kub9vV9v99D6EVxSjOeUY9ASj1KVOQJrqXnMwufLhgB1z_lox8Ph3w6FaMtzrarhQEAl3wGbfvrYvnZUm2sq6wTBxEX7BAdRZQSvyrW2jtUBOOR1a0rNkwt0IlzsMQW7J9wB_4YcKO-i6CG3qnHvA5g-qIzTrrjtjHFabta7lfbFSd1kua_9nuOrvbVe3i0k0sX6ACKFmrW7Rvw9jW30NlgB9m6vkTTJHcFLjg1tGGYrzKqKLYJ58sCFuUay6IabmyeNLaxbGxloiNbnBfY8FBjdpefi1xhiyc-n8Mc2871V2iSvE66PW_bdsHLuSg9HQbm3ggB84Wa-poKTqSiLDW2otSGJRiVIOYBMBrIDIBJ4isdyTTzg4xCEF6jRmG2doNwJJSx1TPNREQoT0GmANLXnCufaRWqW9Syhzb7qoA1ZtV53f05-4xOepNBf9Z_G77fo1N7QZUn5AE1ytUGHtGx-i7z9erJkcUPm86zIw
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