"Minimum Coloring k-Colorable Graphs in Polynomial Average Time."

C. R. Subramanian (1999)

> Home

Details and statistics

DOI: 10.1006/JAGM.1999.1035

access: closed

type: Journal Article

metadata version: 2023-02-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jal/Subramanian99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/Subramanian99
C. R. Subramanian:
Minimum Coloring k-Colorable Graphs in Polynomial Average Time. J. Algorithms 33(1): 112-123 (1999)

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.