Max-flow min-cut theorem and faster algorithms in a circular disk failure model

Article Details
Title:	Max-flow min-cut theorem and faster algorithms in a circular disk failure model
Article URLs:	https://doi.org/10.1109/INFOCOM.2014.6848100
Alternative Article URLs:
Authors:	Yusuke Kobayashi	University of Tokyo Tokyo, 113-8656, Japan
Authors:	Kensuke Otsuki	University of Tokyo Tokyo, 113-8656, Japan
Sharing:	Unknown
Verification:	Authors have not verified information
Artifact Evaluation Badge:	none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key:	conf/infocom/KobayashiO14
Author Comments:

IEEE Conference on Computer Communications, INFOCOM 2014