SIGN IN
SIGN UP
Forests, frames, and games: algorithms for matroid sums and applications
Full Text:
PDF
Buy this Article
Authors:
Harold Gabow
Department of Computer Science, University of Colorado at Boulder, Boulder, CO
Herbert Westermann
Department of Computer Science, University of Colorado at Boulder, Boulder, CO
Published in:
· Proceeding
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Pages 407-421
ACM
New York, NY
, USA
©1988
table of contents
ISBN:0-89791-264-0
doi>
10.1145/62212.62252
1988 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 12
· Downloads (cumulative): 642
· Citation Count: 8
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
combinatorics
graph theory
theory
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