"A polynomial-time nearly-optimal algorithm for an edge coloring problem in ..."

Weifan Wang et al. (2016)

> Home

Details and statistics

DOI: 10.1007/S10898-015-0360-X

access: closed

type: Journal Article

metadata version: 2020-09-11

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jgo/WangHWWD16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgo/WangHWWD16
Weifan Wang, Danjun Huang, Yanwen Wang, Yiqiao Wang, Ding-Zhu Du:
A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs. J. Glob. Optim. 65(2): 351-367 (2016)

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.