The Library
PARALLEL ALGORITHMS FOR APPROXIMATE EDGE COLORING OF SIMPLE GRAPHS
Tools
Tools
Tools
UNSPECIFIED (1987) PARALLEL ALGORITHMS FOR APPROXIMATE EDGE COLORING OF SIMPLE GRAPHS. LECTURE NOTES IN COMPUTER SCIENCE, 287 . pp. 207-225. ISSN 0302-9743.
Research output not available from this repository.
Request-a-Copy directly from author or use local Library Get it For Me service.
| Item Type: | Journal Article | ||||
|---|---|---|---|---|---|
| Subjects: | Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software | ||||
| Journal or Publication Title: | LECTURE NOTES IN COMPUTER SCIENCE | ||||
| Publisher: | SPRINGER VERLAG | ||||
| ISSN: | 0302-9743 | ||||
| Official Date: | 1987 | ||||
| Dates: |
|
||||
| Volume: | 287 | ||||
| Number of Pages: | 19 | ||||
| Page Range: | pp. 207-225 | ||||
| Publication Status: | Published |
Data sourced from Thomson Reuters' Web of Knowledge
Request changes or add full text files to a record
Repository staff actions (login required)
 |
View Item |
