Institutional Repository
| maximum edge-disjoint paths problem in planar graphs | |
| Xia Mingji | |
| 2007 | |
| Conference Name | 4th International Conference on Theory and Applications of Models of Computation |
| Source | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Pages | 566-572 |
| Conference Date | MAY 22-25, |
| Conference Place | Shanghai, PEOPLES R CHINA |
| Indexed Type | ei,istp |
| Publish Place | HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY |
| Publisher | Theory and Applications of Models of Computation, Proceedings |
| ISSN | 0302-9743 |
| ISBN | 978-3-540-72503-9 |
| Department | Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing 100080, Peoples R China. |
| English Abstract | We give a randomized algorithm for maximum edge-disjoint paths problem (MEDP) and the minimal total length of MEDP, if the graphs are planar and all terminals lie on the outer face in the order (s1,) (s2, . . . sk, tk, tk-1, . . .) (t1). Moreo |
| Keyword | Maximum Edge-disjoint Paths Determinant #p-hard |
| Sponsorship | Fudan Univ, Software Sch, Univ Leeds, Univ Wisconsin |
| Language | 英语 |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/11096 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | Xia Mingji. maximum edge-disjoint paths problem in planar graphs[C]. HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY:Theory and Applications of Models of Computation, Proceedings,2007:566-572. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| maximum edge-disjoin（405KB） | 开放获取 | -- | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment