SIGN IN
SIGN UP
Design, implementation, and analysis of maximum transversal algorithms
Full Text:
PDF
Buy this Article
Authors:
Iain S. Duff
RAL and CERFACS, Oxfordshire, UK
Kamer Kaya
CERFACS, France
Bora Uçcar
CNRS and ENS Lyon, Lyon Cedex, France
Published in:
· Journal
ACM Transactions on Mathematical Software (TOMS)
TOMS Homepage
archive
Volume 38 Issue 2, December 2011
Article No. 13
ACM
New York, NY
, USA
table of contents
doi>
10.1145/2049673.2049677
2012 Article
Research
Refereed
Bibliometrics
· Downloads (6 Weeks): 6
· Downloads (12 Months): 69
· Downloads (cumulative): 132
· Citation Count: 2
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
assignment
bipartite graphs
breadth first search
depth first search
graph theory
graph theory
matching
matrix transversals
nonnumerical algorithms and problems
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