Name
Year | DOI | Venue |
|---|---|---|
1985 | 10.1137/0214054 | SIAM J. Comput. |
Keywords | Field | DocType |
protocols,approximation algorithms,np completeness,edge coloring | Approximation algorithm,Edge coloring,Discrete mathematics,Mathematical optimization,Control theory,Combinatorics,Scheduling (computing),Time complexity,Mathematics | Journal |
Volume | Issue | Citations |
14 | 4 | 57 |
PageRank | References | Authors |
14.65 | 8 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| e g coffman | 1 | 1158 | 379.75 |
| M. R. Garey | 2 | 4576 | 1767.42 |
| David S. Johnson | 3 | 1090 | 294.67 |
| Andrea S. Lapaugh | 4 | 302 | 61.25 |