"Representation of Edmonds' Algorithm for Finding Optimum Graph Branching ..."

A. S. Nepomniaschaya (2001)

> Home

Details and statistics

DOI: 10.1023/A:1010918704202

access: closed

type: Journal Article

metadata version: 2022-10-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/pcs/Nepomniaschaya01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/pcs/Nepomniaschaya01
A. S. Nepomniaschaya:
Representation of Edmonds' Algorithm for Finding Optimum Graph Branching on Associative Parallel Processors. Program. Comput. Softw. 27(4): 200-206 (2001)

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.