"Fast Parallel Algorithms for the Approximate Edge-Coloring Problem."

Weifa Liang (1995)

> Home

Details and statistics

DOI: 10.1016/0020-0190(95)00122-S

access: closed

type: Journal Article

metadata version: 2019-09-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/Liang95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/Liang95
Weifa Liang:
Fast Parallel Algorithms for the Approximate Edge-Coloring Problem. Inf. Process. Lett. 55(6): 333-338 (1995)

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.