CiteULike NeilInCanadia's CiteULike Search Register Log in
CiteULike is a free online bibliography manager. Register and you can start organising your references online.

Hardness of the undirected edge-disjoint paths problem Export

by: Matthew Andrews, Lisa Zhang
In STOC '05: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005), pp. 276-283.

Citation Format

[Posts]

View FullText article


NeilInCanadia's tags for this article

graph_theory hardness

X Reviews [Write a review of this article]

X Find related articles from these CiteULike users

X Find related articles with these CiteULike tags

X Posting History

X BibTeX record

X RIS record


Privacy Statement | Terms & Conditions
CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.