Pairwise Disjoint Paths in Pancake Graphs

机译：煎饼图中的成对不相交路径

获取原文

页面导航

摘要
著录项
相似文献
相关主题

摘要

Disjoint paths problems have attracted much attention due to its numerous applications in fault-tolerant routing. The pairwise disjoint paths problem is one of them. In this paper, we propose an algorithm for the pairwise disjoint paths problem in an panc

机译：不连续路径问题由于其在容错路由中的大量应用而备受关注。成对不相交路径问题就是其中之一。在本文中，我们提出了一种解决panc中成对不相交路径问题的算法

著录项

来源
《Parallel and Distributed Computing, Applications and Technologies (PDCAT), 2007 Eighth International Conference on》|2007年|P.376-382|共7页
会议地点 Adelaide SAAustralia
作者
Sawada; N.; Kaneko; K.;
展开▼
作者单位

展开▼
会议组织
原文格式 PDF
正文语种
中图分类
关键词
communication complexity; graph theory; network theory (graphs); fault-tolerant routing; pairwise disjoint paths; pancake graphs;

机译：沟通复杂度；图论网络理论（图）；容错路由；成对的不相交路径；煎饼图;

相似文献

外文文献
中文文献
专利

1. An Algorithm for Node-to-Node Disjoint Paths Problem in Burnt Pancake Graphs [J] . Keiichi KANEKO, Naoki SAWADA IEICE Transactions on Information and Systems . 2007,第1期

机译：薄煎饼图中节点到节点不相交路径的算法
2. An Algorithm for Node-to-Set Disjoint Paths Problem in Burnt Pancake Graphs [J] . Keiichi KANEKO IEICE Transactions on Information and Systems . 2003,第12期

机译：烙饼图中节点到集合不相交路径问题的算法
3. An algorithm for the node-to-set disjoint paths problem in burnt pancake graphs [J] . Keiichi Kaneko 電子情報通信学会技術研究報告. フォ-ルトトレラントシステム . 2002,第262期

机译：烙饼图中节点到集合不相交路径问题的算法
4. Pairwise Disjoint Paths in Pancake Graphs [C] . Sawada Naoki, Kaneko Keiichi, Peng Shietung, International Conference on Parallel and Distributed Computing, Applications and Technologies . 2007

机译：成对在煎饼图中不相交的路径
5. k-Pairwise disjoint shortest paths: Algorithms and complexity. [D] . Serena, Frank David. 2002

机译：k对不相交的最短路径：算法和复杂性。
6. Torus Pairwise Disjoint-Path Routing [O] . Antoine Bossard, Keiichi Kaneko 2018

机译：圆环成对不相交路径路由
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. Disjoint Paths in Densely Embedded Graphs (Preprint). [R] . Kleinberg, J., Tardos, E. 1995

机译：密集嵌入图中的不相交路径（预打印）。

Pairwise Disjoint Paths in Pancake Graphs

摘要

著录项

相似文献

相关主题

期刊订阅