"An NP-hard problem in bipartite graphs."

M. S. Krishnamoorthy (1975)

> Home

Details and statistics

DOI: 10.1145/990518.990521

access: closed

type: Journal Article

metadata version: 2021-08-04

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/sigact/Krishnamoorthy75
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/sigact/Krishnamoorthy75
M. S. Krishnamoorthy:
An NP-hard problem in bipartite graphs. SIGACT News 7(1): 26 (1975)

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.