Parallel algorithms for the tree bisector problem and applications

An edge is a bisector of a simple path if it contains the middle point of the path. In this paper, efficient parallel algorithms are proposed on the EREW PRAM for the single-source and all-pairs tree bisector problems. Two O(log n) time single-source algorithms are proposed. One uses O(n) work and t...

Full description

Saved in:
Bibliographic Details
Published inProceedings of the 1999 International Conference on Parallel Processing pp. 192 - 199
Main Authors Biing-Feng Wang, Shan-Chyun Ku, Keng-Hua Shi, Ting-Kai Hung, Pei-Sen Liu
Format Conference Proceeding
LanguageEnglish
Published IEEE 1999
Subjects
Online AccessGet full text

Cover

Loading…
Abstract An edge is a bisector of a simple path if it contains the middle point of the path. In this paper, efficient parallel algorithms are proposed on the EREW PRAM for the single-source and all-pairs tree bisector problems. Two O(log n) time single-source algorithms are proposed. One uses O(n) work and the other uses O(nlog n) work. The one using O(n) work is more efficient but only applicable to unweighted trees. One all-pairs parallel algorithm is proposed. It requires O(log n) time using O(n/sup 2/) work.
AbstractList An edge is a bisector of a simple path if it contains the middle point of the path. In this paper, efficient parallel algorithms are proposed on the EREW PRAM for the single-source and all-pairs tree bisector problems. Two O(log n) time single-source algorithms are proposed. One uses O(n) work and the other uses O(nlog n) work. The one using O(n) work is more efficient but only applicable to unweighted trees. One all-pairs parallel algorithm is proposed. It requires O(log n) time using O(n/sup 2/) work.
Author Shan-Chyun Ku
Ting-Kai Hung
Biing-Feng Wang
Keng-Hua Shi
Pei-Sen Liu
Author_xml – sequence: 1
  surname: Biing-Feng Wang
  fullname: Biing-Feng Wang
  organization: Dept. of Comput. Sci., Nat. Tsing Hua Univ., Hsinchu, Taiwan
– sequence: 2
  surname: Shan-Chyun Ku
  fullname: Shan-Chyun Ku
– sequence: 3
  surname: Keng-Hua Shi
  fullname: Keng-Hua Shi
– sequence: 4
  surname: Ting-Kai Hung
  fullname: Ting-Kai Hung
– sequence: 5
  surname: Pei-Sen Liu
  fullname: Pei-Sen Liu
BookMark eNp9jrFuwjAUAJ8oSCSFvWLyDyR9jhOStxZR0S1D98ihj2LkxJHtpX_fSDAznXS3XArL0Y0M8CYxlxLp_evQtrkkorymusRyAUmhVJFVe8IX2FLdYL2nClWFtIQEJWGmSDZrSEO4IRZzKRP4aLXX1rIV2v46b-J1COLivIhXFtEzi94EPsfZTN71lgehxx-hp8mas47GjWEDq4u2gbcPvsLu8_h9OGWGmbvJm0H7v-5-qZ7Gf4sQPu8
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/ICPP.1999.797404
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library Online
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library Online
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 2332-5690
EndPage 199
ExternalDocumentID 797404
GroupedDBID -~X
23M
29P
6IE
6IF
6IH
6IK
6IL
6IN
AAJGR
ADZIZ
AFFNX
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
G8K
IEGSK
IPLJI
M43
OCL
RIE
RIL
RNS
XOL
ID FETCH-ieee_primary_7974043
IEDL.DBID RIE
ISBN 9780769503509
0769503500
ISSN 0190-3918
IngestDate Wed Jun 26 19:28:48 EDT 2024
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-ieee_primary_7974043
ParticipantIDs ieee_primary_797404
PublicationCentury 1900
PublicationDate 19990000
PublicationDateYYYYMMDD 1999-01-01
PublicationDate_xml – year: 1999
  text: 19990000
PublicationDecade 1990
PublicationTitle Proceedings of the 1999 International Conference on Parallel Processing
PublicationTitleAbbrev ICPP
PublicationYear 1999
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0020354
Score 2.8931599
Snippet An edge is a bisector of a simple path if it contains the middle point of the path. In this paper, efficient parallel algorithms are proposed on the EREW PRAM...
SourceID ieee
SourceType Publisher
StartPage 192
SubjectTerms Application software
Computer industry
Computer science
Joining processes
Parallel algorithms
Phase change random access memory
Title Parallel algorithms for the tree bisector problem and applications
URI https://ieeexplore.ieee.org/document/797404
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV07T8MwED5BJ6ZCKYLykAfWpEkTJ_FKRVWQQBlA6lbZiQMVJUF5LPx6fHYSHurA5ng4nRI59_j8fQdwHUQBT7xZZnHJUFRbCEtErmtFnHHqy0jKAAnOD4_B8tm_X9FVq7OtuTBSSn35TNq41Fh-WiQNtsqmoUp-UftzP2TMULX62srxqN8xoz3mRqZCZxSBs1baqX9mHVzpsOndPI6RscdsY_zXkBUdYxZDQ96utDQhXi15s5ta2MnnH-HGf7p_CONvMh-J-zB1BHsyH8Gwm-ZA2sN9DDcxL3Gwypbw7UtRburX94qolJaoFJEgdk3EptI9ftJOoSE8T8lPBHwMk8Xt03xpoVfrDyNksTYOeScwyItcngKhoZcInqjfgKrSMpqJEF_tjKYelw4P_DMY7TAw2bl7DgdG4gDbFRcwqMtGXqoAXosr_em-AMOims0
link.rule.ids 310,311,783,787,792,793,799,4057,4058,27937,55086
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3NT8IwFH8xeNATihjFrx68bjC2butVIgEFsgMm3Eg7OiXCZmBc_Ovta7f5EQ7euh6abk33Pn7v93sA937o89jtJhaXDEW1hbBE6DhWyBmnngyl9JHgPJ74gxfvaUZnhc625sJIKXXxmbRxqLH8RRbvMFXWDpTzi9qfh8qtDn1D1qqiq45LvZIb7TInNDE6owidFeJO1TMrAcsOaw97UYScPWab5X-1WdFWpl839O2tFifE4pJ3e5cLO_78I934zxc4geY3nY9ElaE6hQOZNqBe9nMgxfU-g4eIb7C1yorw1Wu2WeZv6y1RTi1RTiJB9JqI5VZn-UnRh4bwdEF-YuBNaPUfp72Bhbuafxgpi7nZkHsOtTRL5QUQGrix4LH6Eag4LaGJCPDTdunC5bLDfe8SGnsWaO2dvYOjwXQ8mo-Gk-crODaCB5i8uIZavtnJG2XOc3Grj_ELDteeGA
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=Proceedings+of+the+1999+International+Conference+on+Parallel+Processing&rft.atitle=Parallel+algorithms+for+the+tree+bisector+problem+and+applications&rft.au=Biing-Feng+Wang&rft.au=Shan-Chyun+Ku&rft.au=Keng-Hua+Shi&rft.au=Ting-Kai+Hung&rft.date=1999-01-01&rft.pub=IEEE&rft.isbn=9780769503509&rft.issn=0190-3918&rft.eissn=2332-5690&rft.spage=192&rft.epage=199&rft_id=info:doi/10.1109%2FICPP.1999.797404&rft.externalDocID=797404
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0190-3918&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0190-3918&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0190-3918&client=summon