首页> 外文OA文献 >Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax k vertex-disjoint paths in a directed acyclic graph

【2h】

Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax k vertex-disjoint paths in a directed acyclic graph

机译：改进的算法，用于在平面图中找到长度有界的两个顶点不相交路径，并在有向无环图中找到minmax k个顶点不相交路径

代理获取

本网站仅为用户提供外文OA文献查询和代理获取服务，本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文，但由于OA文献来源多样且变更频繁，仍可能出现获取不到、文献不完整或与标题不符等情况，如果获取不到我们将提供退款服务。请知悉。

页面导航

著录项
引文网络
相似文献
相关主题

著录项

作者
Yu Chih-Chiang; Lin Chien-Hsin; Wang Biing-Feng;
展开▼
作者单位

展开▼
年度 2010
总页数
原文格式 PDF
正文语种
中图分类

相似文献

外文文献
中文文献
专利

1. Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax k vertex-disjoint paths in a directed acyclic graph [J] . Chih-Chiang Yu, Chien-Hsin Lin, Biing-Feng Wang Journal of computer and system sciences . 2010,第8期

机译：改进的算法，用于在平面图中找到长度有界的两个顶点不相交路径，并在有向无环图中找到minmax k个顶点不相交路径
2. Shortest vertex-disjoint two-face paths in planar graphs [J] . De Verdière E.C., Schrijver A. ACM transactions on algorithms . 2011,第2期

机译：平面图中最短的顶点不相交的双面路径
3. Shortest Vertex-Disjoint Two-Face Paths in Planar Graphs [J] . E}ric Colin de Verdi{e}re, Alexander Schrijver LIPIcs : Leibniz International Proceedings in Informatics . 2008,第2期

机译：平面图中最短的顶点不相交的两面路径
4. Towards Single Face Shortest Vertex-Disjoint Paths in Undirected Planar Graphs [C] . Glencora Borradaile, Amir Nayyeri, Farzad Zafarani Annual European symposium on algorithms . 2015

机译：朝向无向平面图中的单面最短顶点不相交路径
5. Finding minimal cost paths in Raster geographic information system map representations, genetic algorithms, simulated annealing and tabu search. [D] . Albert, Paul. 2004

机译：在栅格地理信息系统地图表示，遗传算法，模拟退火和禁忌搜索中寻找最小成本路径。
6. Estimating the Causal Effect of an Exposure on Change from Baseline UsingDirected Acyclic Graphs and Path Analysis [O] . Cooper S Schumacher, Lianne Sheppard -1

机译：估计暴露对因基线变化引起的因果关系有向无环图和路径分析
7. Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax k vertex-disjoint paths in a directed acyclic graph [O] . Yu, Chih-Chiang 2012

机译：改进的算法，用于在平面图中找到长度有界的两个顶点不相交路径，并在有向无环图中找到minmax k个顶点不相交路径
8. Finding K Disjoint Paths in a Directed Planar Graph [R] . Schrijver, A. 1992

机译：在有向平面图中寻找K个不相交路径

Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax k vertex-disjoint paths in a directed acyclic graph

著录项

引文网络

相似文献

相关主题

期刊订阅