ACM Symposium on Discrete Algorithms, SODA 2014


Article Details
Title: Improved bounds and algorithms for graph cuts and network reliability
Article URLs:
Alternative Article URLs:
Authors: David G. Harris
  • University of Maryland, Department of Applied Mathematics
Aravind Srinivasan
  • University of Maryland, Department of Computer Science
  • University of Maryland, Institute for Advanced Computer Studies
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers: 1010789
DBLP Key: conf/soda/HarrisS14
Author Comments:

Discuss this paper and its artifacts below