Distributed simulation of coloring graph vertices

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Distributed simulation of coloring graph vertices

Full text

Pdf (412 KB)

Source

Annual Simulation Symposium archive
Proceedings of the 24th annual symposium on Simulation table of contents

New Orleans, Louisiana, United States

Pages: 118 - 122

Year of Publication: 1991

ISBN:0-8186-2169-9

Also published in ...

Authors

Milan E. Soklic	Electrical Engineering Department, North Dakota State University, Fargo, ND
Janez Zerovnik	Institute of Mathematics, University of Ljubljana, 61000 Ljubljana, Yugoslavia

Sponsor

SIGSIM: ACM Special Interest Group on Simulation and Modeling

Publisher

IEEE Computer Society Press Los Alamitos, CA, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 12, Citation Count: 0

Additional Information:

references index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	M.R. Garey and D.S. Johnson, CompTlters and Intractability, Freeman, San Francisco, 1979.
	2	A. D. Petford , D. J. Welsh, A randomised 3-colouring algorithm, Discrete Mathematics, v.74 n.1-2, p.253-261, 1989 [doi>10.1016/0012-365X(89)90214-8]
	3	J. Zerovnik, "Parallel Variant of a ~ieuristical Algorithm for Graph Colouring," Parallel Computing, Vol. 13, pp. 95-100, 1990.
	4	INMOS Limited, Occam 2 Reference Manual, Prentice Hall, New York, 1988.