maximum edge-disjoint paths problem in planar graphs
文献类型：会议论文
| 作者 | Xia Mingji |
| 出版日期 | 2007 |
| 会议名称 | 4th International Conference on Theory and Applications of Models of Computation |
| 会议日期 | MAY 22-25, |
| 会议地点 | Shanghai, PEOPLES R CHINA |
| 关键词 | maximum edge-disjoint paths determinant #P-hard |
| 页码 | 566-572 |
| 英文摘要 | 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 |
| 收录类别 | EI,ISTP |
| 会议主办者 | Fudan Univ, Software Sch, Univ Leeds, Univ Wisconsin |
| 会议录 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
 |
| 会议录出版者 | Theory and Applications of Models of Computation, Proceedings |
| 会议录出版地 | HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY |
| 语种 | 英语 |
| ISSN号 | 0302-9743 |
| ISBN号 | 978-3-540-72503-9 |
| 源URL | [http://124.16.136.157/handle/311060/11096]  |
| 专题 | 软件研究所_软件所图书馆_会议论文 |
| 推荐引用方式 GB/T 7714 | Xia Mingji. maximum edge-disjoint paths problem in planar graphs[C]. 见:4th International Conference on Theory and Applications of Models of Computation. Shanghai, PEOPLES R CHINA. MAY 22-25,. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。