"Identifying the minor set cover of dense connected bipartite graphs via ..."

Kathleen E. Hamilton, Travis S. Humble (2017)

> Home

Details and statistics

DOI: 10.1007/S11128-016-1513-7

access: closed

type: Journal Article

metadata version: 2020-04-16

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/qip/HamiltonH17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/qip/HamiltonH17
Kathleen E. Hamilton, Travis S. Humble:
Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets. Quantum Inf. Process. 16(4): 94 (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.