"Efficient parallel algorithms for finding biconnected components of some ..."

Y. Daniel Liang, Sudarshan K. Dhall, Sivaramakrishnan Lakshmivarahan (1991)

> Home

Details and statistics

DOI: 10.1145/327164.327204

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/acm/LiangDL91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/acm/LiangDL91
Y. Daniel Liang, Sudarshan K. Dhall, Sivaramakrishnan Lakshmivarahan:
Efficient parallel algorithms for finding biconnected components of some intersection graphs. ACM Conference on Computer Science 1991: 48-52

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.