"Worst and Best Case Behaviour of an Approximate Graph Coloring Algorithm."

Karl Dürre, Johannes Heuft, Heinrich Müller (1981)

> Home

Details and statistics

DOI: —

access: unavailable

type: Conference or Workshop Paper

metadata version: 2016-10-14

- no documents available
- export record
  dblp key:
  - conf/wg/DurreHM81
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wg/DurreHM81
Karl Dürre, Johannes Heuft, Heinrich Müller:
Worst and Best Case Behaviour of an Approximate Graph Coloring Algorithm. WG 1981: 339-348

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.