ACM DL

SIGN IN   SIGN UP

 
ACM Home Page ACM Digital Library Home Page

Multirate rearrangeable clos networks and a generalized edge coloring problem on bipartite graphs

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Hung Q. Ngo State University of New York at Buffalo, Amherst, NY
Van H. Vu UCSD, La Jolla, CA
Published in:
· Proceeding
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Society for Industrial and Applied Mathematics Philadelphia, PA, USA ©2003
table of contents ISBN:0-89871-538-5
Multirate rearrangeable clos networks and a generalized edge coloring problem on bipartite graphs 2003 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 14
· Citation Count: 2


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 © 2012 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