Counterexamples to the uniform shortest path routing conjecture for vertex-transitive graphs

Sangho Shim; Jozef Siran; Janez Zerovnik

首页> 外文期刊>Discrete Applied Mathematics >Counterexamples to the uniform shortest path routing conjecture for vertex-transitive graphs

【24h】

Counterexamples to the uniform shortest path routing conjecture for vertex-transitive graphs

机译：顶点传递图的统一最短路径路由猜想的反例

获取原文

获取原文并翻译 | 示例

掌桥外文数据库（机构版） >>

开具论文收录证明 >>

文献代查 >>

页面导航

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

摘要

In this note we disprove the uniform shortest path routing conjecture for vertex-transitive graphs by constructing an in finite family of counterexamples.

机译：在本说明中，我们通过构造一个有限的反例族来证明顶点传递图的统一最短路径路由猜想。

著录项

来源
《Discrete Applied Mathematics》 |2002年第3期|共6页
作者
Sangho Shim; Jozef Siran; Janez Zerovnik;
展开▼
作者单位

展开▼
收录信息
原文格式 PDF
正文语种 eng
中图分类离散数学;
关键词
routing; shortest path; vertex-transitive graph;

机译：路由;最短路径;顶点传递图;

相似文献

外文文献
中文文献
专利

1. Counterexamples to the uniform shortest path routing conjecture for vertex-transitive graphs [J] . Sangho Shim, Jozef Siran, Janez Zerovnik Discrete Applied Mathematics . 2002,第3期

机译：顶点传递图的统一最短路径路由猜想的反例
2. Shortest path distance vs. least directional change: Empirical testing of space syntax and geographic theories concerning pedestrian route choice behaviour [J] . Shatu Farjana, Yigitcanlar Tan, Bunker Jonathan Journal of Transport Geography . 2019,第JANa期

机译：最短路径距离与最小方向变化：关于行人路径选择行为的空间语法和地理理论的实证测试
3. A Heuristic Graph-Based Shortest Path Algorithm for Optimizing Routing Problems [J] . E. E. Ogheneovo, E. Seetam American Journal of Engineering Research . 2016,第11期

机译：基于启发式图的最短路径优化路由算法
4. A COMBINED UNIFORM AND HEURISTIC SEARCH ALGORITHM FOR MAINTAINING SHORTEST PATHS ON FULLY DYNAMIC GRAPHS [C] . Sandro Castronovo, Bjorn Kunz, Christian Muller International Conference on Agents and Artificial Intelligence . 2012

机译：一种组合统一和启发式搜索算法，用于维护完全动态图中的最短路径
5. Resilient Routing in Software Defined Networks Utilizing Residue Number System and Shortest Path Fast Re-Routing Technique [D] . Oke, Afeez Adeshina. 2021

机译：利用Reside Number System和最短路径快速重新路由技术，软件定义网络中的弹性路由
6. The Path Not Taken: Exploring Structural Differences in Mapped- Versus Shortest-Network-Path School Travel Routes [O] . Ron N. Buliung, Kristian Larsen, Guy E. J. Faulkner, 2013

机译：未走的道路：探索地图和最短网络路径学校出行路线的结构差异
7. Counterexamples to the uniform shortest path routing conjecture for vertex-transitive graphs [O] . Shim Sangho, Širáň Jozef, Žerovnik Janez 2002

机译：顶点传递图的统一最短路径路由猜想的反例

Counterexamples to the uniform shortest path routing conjecture for vertex-transitive graphs

摘要

著录项

相似文献

相关主题

期刊订阅