The Library
FAST PARALLEL ALGORITHMS FOR OPTIMAL EDGE-COLORING OF SOME TREE-STRUCTURED GRAPHS
Tools
Tools
Tools
UNSPECIFIED (1987) FAST PARALLEL ALGORITHMS FOR OPTIMAL EDGE-COLORING OF SOME TREE-STRUCTURED GRAPHS. LECTURE NOTES IN COMPUTER SCIENCE, 278 . pp. 155-162. ISSN 0302-9743
Full text not available from this repository.| 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 |
| Date: | 1987 |
| Volume: | 278 |
| Number of Pages: | 8 |
| Page Range: | pp. 155-162 |
| Publication Status: | Published |
| URI: | http://wrap.warwick.ac.uk/id/eprint/24636 |
Data sourced from Thomson Reuters' Web of Knowledge
Actions (login required)
 |
View Item |
