Graph coloring algorithms for fast evaluation of Curtis decompositions

doi:10.1145/309847.309918

Graph coloring algorithms for fast evaluation of Curtis decompositions

Full Text:

PDF

Buy this Article

Authors:	Marek Perkowski	Portland State University, Department of Electrical and Computer Engineering, Portland, Oregon
	Rahul Malvi	Portland State University, Department of Electrical and Computer Engineering, Portland, Oregon
	Stan Grygiel	Portland State University, Department of Electrical and Computer Engineering, Portland, Oregon
	Mike Burns	Portland State University, Department of Electrical and Computer Engineering, Portland, Oregon
	Alan Mishchenko	Portland State University, Department of Electrical and Computer Engineering, Portland, Oregon

	1999 Article
Bibliometrics
· Downloads (6 Weeks): 0 · Downloads (12 Months): 5 · Citation Count: 4

Published in:

	· Proceeding
	DAC '99 Proceedings of the 36th annual ACM/IEEE Design Automation Conference
	ACM New York, NY, USA ©1999 table of contents ISBN:1-58113-109-7 doi>10.1145/309847.309918

Tools and Resources

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

Tags: algorithms design graph theory verification

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

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player