"T-joins in strongly connected hypergraphs."

Gruia Calinescu (2017)

> Home

Details and statistics

DOI: 10.1142/S1793830917500689

access: closed

type: Journal Article

metadata version: 2024-10-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dmaa/Calinescu17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dmaa/Calinescu17
Gruia Calinescu:
T-joins in strongly connected hypergraphs. Discret. Math. Algorithms Appl. 9(6): 1750068:1-1750068:19 (2017)

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.