Abstract
Previous article Full AccessCorrigendum: Edge-Disjoint Paths in Expander GraphsAlan FriezeAlan Friezehttps://doi.org/10.1137/S0097539701395097PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout"Corrigendum: Edge-Disjoint Paths in Expander Graphs." SIAM Journal on Computing, 31(3), p. 988[1] Alan Frieze, Edge-disjoint paths in expander graphs, SIAM J. Comput., 30 (2001), 1790–1801 1856557 LinkISIGoogle Scholar Previous article FiguresRelatedReferencesCited byDetails Volume 31, Issue 3| 2001SIAM Journal on Computing History Published online:17 February 2012 InformationCopyright © 2002 Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/S0097539701395097Article page range:pp. 988-988ISSN (print):0097-5397ISSN (online):1095-7111Publisher:Society for Industrial and Applied Mathematics
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
