"An Efficient Algorithm for the Transitive Closure and a Linear Worst-Case ..."

Brigitte Jaumard, Michel Minoux (1986)

> Home

Details and statistics

DOI: 10.1016/0020-0190(86)90021-9

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/JaumardM86
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/JaumardM86
Brigitte Jaumard, Michel Minoux:
An Efficient Algorithm for the Transitive Closure and a Linear Worst-Case Complexity Result for a Class of Sparse Graphs. Inf. Process. Lett. 22(4): 163-169 (1986)

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.