"Calculating a Relational Program for Transitive Reductions of Strongly ..."

Rudolf Berghammer, Thorsten Hoffmann (2001)

> Home

Details and statistics

DOI: 10.1007/3-540-36280-0_18

access: closed

type: Conference or Workshop Paper

metadata version: 2021-10-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/RelMiCS/BerghammerH01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/RelMiCS/BerghammerH01
Rudolf Berghammer, Thorsten Hoffmann:
Calculating a Relational Program for Transitive Reductions of Strongly Connected Graphs. RelMiCS 2001: 258-275

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.