CONSTRUCTING DISJOINT PATHS ON EXPANDER GRAPHS.

David Peleg, Eli Upfal

Research output: Contribution to journal › Conference article › peer-review

10 Scopus citations

Original language	English
Pages (from-to)	264-273
Number of pages	10
Journal	Conference Proceedings of the Annual ACM Symposium on Theory of Computing
DOIs	https://doi.org/10.1145/28395.28424
State	Published - 1987
Externally published	Yes

Access to Document

@article{edef7057b5e0409abce4f33070061091,

title = "CONSTRUCTING DISJOINT PATHS ON EXPANDER GRAPHS.",

author = "David Peleg and Eli Upfal",

year = "1987",

doi = "10.1145/28395.28424",

language = "אנגלית",

pages = "264--273",

journal = "Conference Proceedings of the Annual ACM Symposium on Theory of Computing",

issn = "0734-9025",

publisher = "Association for Computing Machinery (ACM)",

}

TY - JOUR

T1 - CONSTRUCTING DISJOINT PATHS ON EXPANDER GRAPHS.

AU - Peleg, David

AU - Upfal, Eli

PY - 1987

Y1 - 1987

UR - http://www.scopus.com/inward/record.url?scp=0023606265&partnerID=8YFLogxK

U2 - 10.1145/28395.28424

DO - 10.1145/28395.28424

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???

AN - SCOPUS:0023606265

SN - 0734-9025

SP - 264

EP - 273

JO - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

JF - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

ER -