SIGN IN
SIGN UP
Data structures for on-line updating of matroid intersection solutions
Full Text:
PDF
Buy this Article
Authors:
Greg N. Frederickson
Mandayam A. Srinivas
Published in:
· Proceeding
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Pages 383-390
ACM
New York, NY
, USA
©1984
table of contents
ISBN:0-89791-133-4
doi>
10.1145/800057.808704
1984 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 10
· Downloads (cumulative): 178
· Citation Count: 0
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
online computation
performance
theory
trees
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