The Library
PARALLEL O(LOG N) TIME EDGE-COLOURING OF TREES AND HALIN GRAPHS
Tools
Tools
Tools
UNSPECIFIED (1988) PARALLEL O(LOG N) TIME EDGE-COLOURING OF TREES AND HALIN GRAPHS. INFORMATION PROCESSING LETTERS, 27 (1). pp. 43-51. ISSN 0020-0190
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: | INFORMATION PROCESSING LETTERS |
| Publisher: | ELSEVIER SCIENCE BV |
| ISSN: | 0020-0190 |
| Date: | 15 February 1988 |
| Volume: | 27 |
| Number: | 1 |
| Number of Pages: | 9 |
| Page Range: | pp. 43-51 |
| Publication Status: | Published |
| URI: | http://wrap.warwick.ac.uk/id/eprint/24508 |
Data sourced from Thomson Reuters' Web of Knowledge
Actions (login required)
 |
View Item |
