maximum edge-disjoint paths problem in planar graphs

ISCAS OpenIR

	maximum edge-disjoint paths problem in planar graphs
	Xia Mingji
	2007
会议名称	4th International Conference on Theory and Applications of Models of Computation
会议录名称	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
页码	566-572
会议日期	MAY 22-25,
会议地点	Shanghai, PEOPLES R CHINA
收录类别	ei,istp
出版地	HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
出版者	Theory and Applications of Models of Computation, Proceedings
ISSN	0302-9743
ISBN	978-3-540-72503-9
部门归属	Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing 100080, Peoples R China.
摘要	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
关键词	Maximum Edge-disjoint Paths Determinant #p-hard
主办者	Fudan Univ, Software Sch, Univ Leeds, Univ Wisconsin
语种	英语
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/11096
专题	中国科学院软件研究所
推荐引用方式 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.