"An Efficient Parallel Algorithm for Computing a Maximal Independent Set in ..."

Elias Dahlhaus, Marek Karpinski, Pierre Kelsen (1992)

> Home

Details and statistics

DOI: 10.1016/0020-0190(92)90228-N

access: closed

type: Journal Article

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/DahlhausKK92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/DahlhausKK92
Elias Dahlhaus, Marek Karpinski, Pierre Kelsen:
An Efficient Parallel Algorithm for Computing a Maximal Independent Set in a Hypergraph of Dimension 3. Inf. Process. Lett. 42(6): 309-313 (1992)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.