Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"On the Computational Complexity of Finding Bipartite Graphs with a Small ..."

Ali Dehghan, Amir H. Banihashemi (2019)

> Home

Details and statistics

DOI: 10.1109/ITW44776.2019.8989134

access: closed

type: Conference or Workshop Paper

metadata version: 2020-02-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/itw/DehghanB19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/itw/DehghanB19
Ali Dehghan, Amir H. Banihashemi:
On the Computational Complexity of Finding Bipartite Graphs with a Small Number of Short Cycles and Large Girth. ITW 2019: 1-5

a service of

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.