首页> 外文会议>Mathematical methods for information science and economics >The Determination of a Maximal Chain in an Undirected Graph
【24h】

The Determination of a Maximal Chain in an Undirected Graph

机译:无向图中最大链的确定

获取原文
获取原文并翻译 | 示例

摘要

Determination of a maximal chain in an undirected graph has heuristic or indirect solutions because of the problem caused by the existence of cycles. The method presented in this article to solve this problems is based on a procedure we called "EXFOLIATING" a graph: iteratively, the structure of peripheral edges and nodes is eliminated, connecting in a convenient way the structure resulted after the exfoliation.
机译:由于存在循环而导致问题,因此无向图中最大链的确定具有启发式或间接解决方案。本文介绍的解决此问题的方法基于一个称为“ EXFOLIATING”图的过程:反复地消除外围边缘和结点的结构,以方便的方式连接剥落后得到的结构。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号