Color-coding

doi:10.1145/210332.210337

Color-coding

Full Text:

PDF

Buy this Article

Authors:	Noga Alon	Institute for Advanced Study, Princeton, NJ; and Tel-Aviv Univ., Tel-Aviv, Israel
	Raphael Yuster	Tel-Aviv Univ., Tel-Aviv, Israel
	Uri Zwick	Tel-Aviv Univ., Tel-Aviv, Israel

Published in:

· Journal

Journal of the ACM (JACM) JACM Homepage archive

Volume 42 Issue 4, July 1995
Pages 844-856
ACM New York, NY, USA
table of contents doi>10.1145/210332.210337

	1995 Article
Bibliometrics
· Downloads (6 Weeks): 20 · Downloads (12 Months): 150 · Downloads (cumulative): 1,866 · Citation Count: 166

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref

Share:

|

Tags: algorithms derandomization graph algorithms path and circuit problems perfect hashing subgraph isomorphism tree-width

Feedback | Switch to single page view (no tabs)

**Javascript is not enabled and is required for the "tabbed view" or switch to the single page view**

Powered by

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player

The ACM Guide to Computing Literature

All Tags

Export Formats

Save to Binder