From post

копировать удалить добавить публикацию в буфер
Запись сообщества
посмотреть историю данной записи
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Edge-disjoint paths in permutation graphs.

C. Gopalakrishnan, и C. Rangan. Discussiones Mathematicae Graph Theory, 15 (1): 59-72 (1995)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

A linear algorithms for the two paths problem on permutation graphs.C. Gopalakrishnan, и C. Rangan. Discussiones Mathematicae Graph Theory, 15 (2): 147-166 (1995)Edge-disjoint paths in permutation graphs.C. Gopalakrishnan, и C. Rangan. Discussiones Mathematicae Graph Theory, 15 (1): 59-72 (1995)Edge-Disjoint Paths in Permutation Graphs.C. Gopalakrishnan, и C. Rangan. ISAAC, том 834 из Lecture Notes in Computer Science, стр. 208-216. Springer, (1994)Efficient algorithms for minimal disjoint path problems on chordal graphs.C. Gopalakrishnan, C. Rangan, и S. Coorg. Discussiones Mathematicae Graph Theory, 15 (2): 119-145 (1995)