A Parallel Randomized Algorithm for Finding a Maximal Independent Set in a Linear Hypergraph

We present a randomized parallel algorithm with polylogarithmic expected running time for finding a maximal independent set in a linear hypergraph.

Saved in:
Bibliographic Details
Published in:Journal of algorithms Vol. 25; no. 2; pp. 311 - 320
Main Authors: Łuczak, Tomasz, Szymańska, Edyta
Format: Journal Article
Language:English
Published: San Diego, CA Elsevier Inc 01.11.1997
Elsevier
Subjects:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science; control theory; systems
Exact sciences and technology
Information retrieval. Graph
Theoretical computing
Hypergraph
Independent set
Maximal graph
Polynomial algorithm
Randomized algorithm
Parallel algorithms
ISSN:0196-6774, 1090-2678
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract We present a randomized parallel algorithm with polylogarithmic expected running time for finding a maximal independent set in a linear hypergraph.
AbstractList We present a randomized parallel algorithm with polylogarithmic expected running time for finding a maximal independent set in a linear hypergraph.
Author Łuczak, Tomasz
Szymańska, Edyta
Author_xml – sequence: 1
  givenname: Tomasz
  surname: Łuczak
  fullname: Łuczak, Tomasz
– sequence: 2
  givenname: Edyta
  surname: Szymańska
  fullname: Szymańska, Edyta
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=2053982$$DView record in Pascal Francis
BookMark eNp1kE1Lw0AQhhdRsK1ePe_Ba-JussnuHkuxtlBR_LgJYbKZpFvSTdgEsf56EyoehF5mDvM-w8wzJeeucUjIDWchZyy920G1D7nWMmRKiTMy4UyzIEqlOicTxnUapFKKSzLtuh1jnCdCT8jHnD6Dh7rGmr6AK5q9_caCzuuq8bbf7mnZeLq0rrCuokAf4cvuoaZrV2CLQ3E9fcWeWjcMN9YheLo6tOgrD-32ilyUUHd4_dtn5H15_7ZYBZunh_VivglMzJM-QEijXDGdlyWHRBrkXKEsY5nmLNKQMskkapHwvJSKS6FNoYQQcR7z2Ki4iGfk9ri3hc5AXXpwxnZZ64db_SGLWBJrFQ2x8Bgzvuk6j-VfgrNsVJiNCrNRYTYqHADxDzC2h942rvdg69OYOmI4_Pxp0WedsegMFtaj6bOisafQH9h-ioo
CODEN JOALDV
CitedBy_id crossref_primary_10_1016_j_tcs_2007_03_005
crossref_primary_10_1145_2938436
crossref_primary_10_1007_s11277_020_07528_3
crossref_primary_10_1145_3326171
crossref_primary_10_1016_j_ipl_2006_09_006
crossref_primary_10_1137_S0097539797323716
crossref_primary_10_1137_S0895480102419731
crossref_primary_10_1016_j_csi_2018_07_004
Cites_doi 10.1145/800057.808690
10.1137/0215074
10.1016/0020-0190(92)90228-N
10.1137/0402028
10.1145/129712.129745
10.1016/0196-6774(86)90019-2
ContentType Journal Article
Copyright 1997 Academic Press
1998 INIST-CNRS
Copyright_xml – notice: 1997 Academic Press
– notice: 1998 INIST-CNRS
DBID AAYXX
CITATION
IQODW
DOI 10.1006/jagm.1997.0884
DatabaseName CrossRef
Pascal-Francis
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
Applied Sciences
EISSN 1090-2678
EndPage 320
ExternalDocumentID 2053982
10_1006_jagm_1997_0884
S0196677497908841
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
1B1
1RT
1~.
1~5
29J
4.4
4G.
5GY
5VS
7-5
71M
8P~
9JN
AACTN
AAEDT
AAEDW
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AAXUO
AAYFN
ABAOU
ABBOA
ABEFU
ABMAC
ABTAH
ABXDB
ABYKQ
ACAZW
ACDAQ
ACGFS
ACNNM
ACRLP
ACZNC
ADBBV
ADEZE
ADFGL
ADGUI
ADIYS
ADJOM
ADMUD
AEBSH
AEKER
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHZHX
AIEXJ
AIGVJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
ASPBG
AVWKF
AXJTR
AZFZN
BKOJK
BLXMC
CAG
COF
CS3
DM4
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
FA8
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-2
G-Q
G8K
GBOLZ
HLZ
HMJ
HVGLF
HZ~
IHE
KOM
LG5
LX9
M25
MHUIS
MO0
MVM
N9A
O-L
O9-
OAUVE
OZT
P-9
P2P
PC.
Q38
R2-
RIG
ROL
RPZ
SBC
SDF
SDG
SDP
SEW
SME
SPC
SSV
SSW
SSZ
T5K
TN5
TWZ
UPT
UQL
WUQ
XJT
XPP
YQT
ZCA
ZU3
ZY4
9DU
AATTM
AAXKI
AAYWO
AAYXX
ABDPE
ABJNI
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
AEIPS
AEUPX
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
CITATION
EFKBS
~HD
AFXIZ
AGCQF
AGRNS
IQODW
SSH
ID FETCH-LOGICAL-c315t-ea62b809bff1a57ce118e7f376b029a60707e9451bf781749cd84443b313c83d3
ISICitedReferencesCount 16
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=10_1006_jagm_1997_0884&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0196-6774
IngestDate Mon Jul 21 09:17:52 EDT 2025
Sat Nov 29 06:24:23 EST 2025
Tue Nov 18 21:44:08 EST 2025
Fri Feb 23 02:22:55 EST 2024
IsPeerReviewed true
IsScholarly true
Issue 2
Keywords Hypergraph
Independent set
Maximal graph
Polynomial algorithm
Randomized algorithm
Parallel algorithms
Language English
License https://www.elsevier.com/tdm/userlicense/1.0
CC BY 4.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c315t-ea62b809bff1a57ce118e7f376b029a60707e9451bf781749cd84443b313c83d3
PageCount 10
ParticipantIDs pascalfrancis_primary_2053982
crossref_primary_10_1006_jagm_1997_0884
crossref_citationtrail_10_1006_jagm_1997_0884
elsevier_sciencedirect_doi_10_1006_jagm_1997_0884
PublicationCentury 1900
PublicationDate 1997-11-01
PublicationDateYYYYMMDD 1997-11-01
PublicationDate_xml – month: 11
  year: 1997
  text: 1997-11-01
  day: 01
PublicationDecade 1990
PublicationPlace San Diego, CA
PublicationPlace_xml – name: San Diego, CA
PublicationTitle Journal of algorithms
PublicationYear 1997
Publisher Elsevier Inc
Elsevier
Publisher_xml – name: Elsevier Inc
– name: Elsevier
References Goldberg, Spencer (AL970884RF4) 1989; 1
P. Kelsen, On the parallel complexity of computing a maximal independent set in a hypergraph, Proceedings of the 24th ACM Symposium on Theory of Computing, 1992
Luby (AL970884RF8) 1986; 15
P. Beame, M. Luby, Parallel search for maximal independence given minimal dependence, Proceedings of the First SODA Conference, 1990, 212, 218
Dahlhaus, Karpiński, Kelsen (AL970884RF3) 1992; 42
R. Karp, A. Wigderson, A fast parallel algorithm for the maximal independent set problem, Proceedings of the 16th ACM Symposium on Theory of Computing, 1984, 266, 272
Alon, Babai, Itai (AL970884RF1) 1986; 7
Karp, Ramachandran (AL970884RF5) 1990
Karp (10.1006/jagm.1997.0884_AL970884RF5) 1990
Dahlhaus (10.1006/jagm.1997.0884_AL970884RF3) 1992; 42
10.1006/jagm.1997.0884_AL970884RF6
10.1006/jagm.1997.0884_AL970884RF7
10.1006/jagm.1997.0884_AL970884RF2
Luby (10.1006/jagm.1997.0884_AL970884RF8) 1986; 15
Goldberg (10.1006/jagm.1997.0884_AL970884RF4) 1989; 1
Alon (10.1006/jagm.1997.0884_AL970884RF1) 1986; 7
References_xml – volume: 1
  start-page: 322
  year: 1989
  end-page: 328
  ident: AL970884RF4
  article-title: Constructing a maximal independent set in parallel
  publication-title: SIAM J. Discrete Math.
– reference: P. Kelsen, On the parallel complexity of computing a maximal independent set in a hypergraph, Proceedings of the 24th ACM Symposium on Theory of Computing, 1992
– reference: P. Beame, M. Luby, Parallel search for maximal independence given minimal dependence, Proceedings of the First SODA Conference, 1990, 212, 218
– volume: 15
  start-page: 1036
  year: 1986
  end-page: 1053
  ident: AL970884RF8
  article-title: A simply parallel algorithm for the maximal independent set problem
  publication-title: SIAM J. Comput.
– volume: 7
  start-page: 567
  year: 1986
  end-page: 583
  ident: AL970884RF1
  article-title: A fast and simple randomized parallel algorithm for the maximal independent set problem
  publication-title: J. Algorithm
– year: 1990
  ident: AL970884RF5
  publication-title: Handbook of Theoretical Computer Science
– volume: 42
  start-page: 309
  year: 1992
  end-page: 313
  ident: AL970884RF3
  article-title: An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3
  publication-title: Inform. Process. Lett.
– reference: R. Karp, A. Wigderson, A fast parallel algorithm for the maximal independent set problem, Proceedings of the 16th ACM Symposium on Theory of Computing, 1984, 266, 272
– ident: 10.1006/jagm.1997.0884_AL970884RF6
  doi: 10.1145/800057.808690
– volume: 15
  start-page: 1036
  year: 1986
  ident: 10.1006/jagm.1997.0884_AL970884RF8
  article-title: A simply parallel algorithm for the maximal independent set problem
  publication-title: SIAM J. Comput.
  doi: 10.1137/0215074
– volume: 42
  start-page: 309
  year: 1992
  ident: 10.1006/jagm.1997.0884_AL970884RF3
  article-title: An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3
  publication-title: Inform. Process. Lett.
  doi: 10.1016/0020-0190(92)90228-N
– ident: 10.1006/jagm.1997.0884_AL970884RF2
– volume: 1
  start-page: 322
  year: 1989
  ident: 10.1006/jagm.1997.0884_AL970884RF4
  article-title: Constructing a maximal independent set in parallel
  publication-title: SIAM J. Discrete Math.
  doi: 10.1137/0402028
– ident: 10.1006/jagm.1997.0884_AL970884RF7
  doi: 10.1145/129712.129745
– year: 1990
  ident: 10.1006/jagm.1997.0884_AL970884RF5
– volume: 7
  start-page: 567
  year: 1986
  ident: 10.1006/jagm.1997.0884_AL970884RF1
  article-title: A fast and simple randomized parallel algorithm for the maximal independent set problem
  publication-title: J. Algorithm
  doi: 10.1016/0196-6774(86)90019-2
SSID ssj0011549
Score 1.4564703
Snippet We present a randomized parallel algorithm with polylogarithmic expected running time for finding a maximal independent set in a linear hypergraph.
SourceID pascalfrancis
crossref
elsevier
SourceType Index Database
Enrichment Source
Publisher
StartPage 311
SubjectTerms Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science; control theory; systems
Exact sciences and technology
Information retrieval. Graph
Theoretical computing
Title A Parallel Randomized Algorithm for Finding a Maximal Independent Set in a Linear Hypergraph
URI https://dx.doi.org/10.1006/jagm.1997.0884
Volume 25
WOSCitedRecordID wos10_1006_jagm_1997_0884&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1090-2678
  dateEnd: 20091031
  omitProxy: false
  ssIdentifier: ssj0011549
  issn: 0196-6774
  databaseCode: AIEXJ
  dateStart: 19950101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1da9swFBUh3cNg7Hus2zr0sLGH4s6WZEt6DCWlG1sZWzfyMDCSbLdmiRMct6T59buy_JFQAttgLyY4iix0j6-OlHvPRehNkAmaCZJ4RkvmMZkQT3MSeqFRTGck83ktKfTjEz87E5OJ_DIYLNpcmOspLwqxWsnFfzU13ANj29TZvzB31yncgM9gdLiC2eH6R4YfASssbYWU6eFXVSTzWb4GUjmaXszLvLqc1XGFJ7lLZlGHn9Uqn9V6G2053Ar8R103QNkNu9X5OYW9atkXp7hNZVXbeUfQ3x6HwFGvzFq5SGwbhbTuTnPWNzNVt2DLXzV5HSc3leoPIGrx1mDrAKLLjNkK3LSyO17EXQWeo9Q5V1_6HolcyZ7W-7q05wZlZMOV0sYJu1WZ1ilztx0-OI260MDFzOZd8iNwmqxf2rqAw292PHY4ktvALqt0sEd4KMUQ7Y0-jCcfu3-erGSdS7F342-FPv3o_fZTdhGZewu1hNcrc3VRNsjK-UN0vzENHjl0PEKDtHiMHrQVPHDj0J-gnyPcggX3YMEdWDCABTdgwQo3YMEbYMEAFpwX8KUDC-7B8hR9PxmfH596Tb0Nz9AgrLxURUQLX-osC1TITQqbz5RnsARpn0gVWWWoVLIw0BkXsJOVJhGMMappQI2gCX2GhsW8SJ8jHHCjiAFyRJlmUSS0pEz5oQG2T6nheh957eTFphGjtzVRprGT0Y5iO9mxnezYTvY-ete1XzgZlp0tg9YWcUMiHTmMATI7f3OwZbTuEQSWKCnIi3_o8yW6278sr9CwKq_SA3THXFf5snzdoO43Duec7w
linkProvider Elsevier
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%3Ajournal&rft.genre=article&rft.atitle=A+Parallel+Randomized+Algorithm+for+Finding+a+Maximal+Independent+Set+in+a+Linear+Hypergraph&rft.jtitle=Journal+of+algorithms&rft.au=%C5%81uczak%2C+Tomasz&rft.au=Szyma%C5%84ska%2C+Edyta&rft.date=1997-11-01&rft.pub=Elsevier+Inc&rft.issn=0196-6774&rft.eissn=1090-2678&rft.volume=25&rft.issue=2&rft.spage=311&rft.epage=320&rft_id=info:doi/10.1006%2Fjagm.1997.0884&rft.externalDocID=S0196677497908841
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0196-6774&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0196-6774&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0196-6774&client=summon