"Optimal Parallel Algorithm for Finding st-Ambitus of a Planar Biconnected ..."

K. S. Easwarakumar et al. (1996)

> Home

Details and statistics

DOI: 10.1007/BF01975868

access: closed

type: Journal Article

metadata version: 2022-10-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/EaswarakumarKRS96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/EaswarakumarKRS96
K. S. Easwarakumar, S. V. Krishnan, C. Pandu Rangan, S. Seshadri:
Optimal Parallel Algorithm for Finding st-Ambitus of a Planar Biconnected Graph. Algorithmica 15(3): 242-255 (1996)

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.