Improved algorithms for weakly chordal graphs

doi:10.1145/1240233.1240237

Improved algorithms for weakly chordal graphs

Full Text:

Pdf

Buy this Article

Authors:	Ryan B. Hayward	University of Alberta, Edmonton, Canada
	Jeremy P. Spinrad	Vanderbilt University, Nashville TN
	R. Sritharan	The University of Dayton, College Park, Dayton OH

Published in:

	· Journal
	ACM Transactions on Algorithms (TALG) TALG Homepage archive
	Volume 3 Issue 2, May 2007 Article No. 14 ACM New York, NY, USA table of contents doi>10.1145/1240233.1240237

	2007 Article
Bibliometrics
· Downloads (6 Weeks): 9 · Downloads (12 Months): 36 · Downloads (cumulative): 463 · Citation Count: 4

Tools and Resources

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

Share:

|

Tags: algorithms coloring graph algorithms nonnumerical algorithms and problems perfect graphs recognition weakly chordal

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