首页> 外文OA文献 >Algorithms to Compute Minimum Cycle Basis in Directed Graphs

【2h】

Algorithms to Compute Minimum Cycle Basis in Directed Graphs

机译：有向图中计算最小周期基的算法

页面导航

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

著录项

作者
Kavitha T.; Mehlhorn K.;
展开▼
作者单位

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

相似文献

外文文献
中文文献
专利

1. Algorithms to Compute Minimum Cycle Basis in Directed Graphs [J] . Telikepalli Kavitha, Kurt Mehlhorn Theory of computing systems . 2007,第4期

机译：有向图中最小周期基础的计算算法
2. Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs [J] . Karl Bringmann, Thomas Dueholm Hansen, Sebastian Krinninger LIPIcs : Leibniz International Proceedings in Informatics . 2017,第2期

机译：改进的有向图计算最小成本时间比周期的算法
3. Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs [J] . Karl Bringmann, Thomas Dueholm Hansen, Sebastian Krinninger LIPIcs : Leibniz International Proceedings in Informatics . 2017,第4期

机译：改进的有向图计算最小成本时间比周期的算法
4. An O(m~2n) Randomized Algorithm to Compute a Minimum Cycle Basis of a Directed Graph [C] . Telikepalli Kavitha International Colloquium on Automata, Languages and Programming(ICALP 2005); 20050711-15; Lisbon(PT) . 2005

机译：O（m〜2n）随机算法计算有向图的最小循环基
5. Disjoint cycles in graphs and directed graphs. [D] . Zhang, Danhong. 2004

机译：图和有向图中的不相交循环。
6. Heart-Rate Dependent Improvement in Image Quality and Diagnostic Accuracy of Coronary Computed Tomographic Angiography by Novel Intra-cycle Motion Correction Algorithm [O] . Iksung Cho, Kimberly Elmore, Bríain ó Hartaigh, -1

机译：新颖的周期内运动校正算法对冠状动脉计算机断层扫描血管造影的图像质量和诊断准确性的依赖于心率的改善
7. Algorithms to Compute Minimum Cycle Basis in Directed Graphs [O] . Telikepalli Kavitha, Kurt Mehlhorn 2005

机译：有向图中最小周期基础的计算算法

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

客服微信
服务号