"Counting Short Cycles in Bipartite Graphs: A Fast Technique/Algorithm and ..."

Ali Dehghan, Amir H. Banihashemi (2020)

> Home

Details and statistics

DOI: 10.1109/TCOMM.2019.2962397

access: closed

type: Journal Article

metadata version: 2020-09-01

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tcom/DehghanB20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcom/DehghanB20
Ali Dehghan, Amir H. Banihashemi:
Counting Short Cycles in Bipartite Graphs: A Fast Technique/Algorithm and a Hardness Result. IEEE Trans. Commun. 68(3): 1378-1390 (2020)

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.