"On Parallel Complexity of Maximum f-matching and the Degree Sequence Problem."

Anders Dessmark, Andrzej Lingas, Oscar Garrido (1994)

> Home

Details and statistics

DOI: 10.1007/3-540-58338-6_78

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-20

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/mfcs/DessmarkLG94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mfcs/DessmarkLG94
Anders Dessmark, Andrzej Lingas, Oscar Garrido:
On Parallel Complexity of Maximum f-matching and the Degree Sequence Problem. MFCS 1994: 316-325

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.