An asymptotic approximation scheme for multigraph edge coloring

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Peter Sanders University of Karlsruhe
David Steurer Max Planck Institute for Computer Science
Published in:
Cover Image
 
· Journal
ACM Transactions on Algorithms (TALG) TALG Homepage archive
Volume 4 Issue 2, May 2008
Article No. 21
ACM New York, NY, USA
table of contents doi>10.1145/1361192.1361198
An asymptotic approximation scheme for multigraph edge coloring Published by ACM 2008 Article
  • Research
  • Refereed
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 32
· Downloads (cumulative): 336
· Citation Count: 3


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


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