SIGN IN
SIGN UP
Locality based graph coloring
Full Text:
PDF
Buy this Article
Authors:
Márió Szegedy
Sundar Vishwanathan
Published in:
· Proceeding
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Pages 201-207
ACM
New York, NY
, USA
©1993
table of contents
ISBN:0-89791-591-7
doi>
10.1145/167088.167156
1993 Article
Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 25
· Downloads (cumulative): 477
· Citation Count: 14
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
STOC'13
Share:
|
Tags:
algorithms
computations on discrete structures
network problems
packet-switching networks
theory
verification
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 Guide to Computing Literature
All Tags
Export Formats
Save to Binder