On the intercluster distance of a tree metric-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

On the intercluster distance of a tree metric

Published:2006-12 Issue:1-3 Volume:369 Page:136-141
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Wu Bang Ye

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference18 articles.

1. The complexity of minimizing certain cost metrics for k-source spanning trees;Connamacher;Discrete Appl. Math.,2003

2. Introduction to Algorithms;Cormen,1994

3. MAD trees and distance-hereditary graphs;Dahlhaus;Discrete Appl. Math.,2003

4. A linear-time algorithm to compute a MAD tree of an interval graph;Dahlhaus;Inform. Process. Lett.,2004

5. Average distance in colored graphs;Dankelmann;J. Graph Theory,2001

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Hybrid Fuzzy Fireworks and Grey Wolf Metaheuristic Algorithm;Studies in Computational Intelligence;2024

2. Basic Concepts of Neural Networks and Fuzzy Logic;Hybrid Competitive Learning Method Using the Fireworks Algorithm and Artificial Neural Networks;2023

3. Interval Type 2 Fuzzy Fireworks Algorithm for Clustering;Handbook of Research on Fireworks Algorithms and Swarm Intelligence;2020

4. Optimal Number of Clusters Finding Using the Fireworks Algorithm;Hybrid Intelligent Systems in Control, Pattern Recognition and Medicine;2019-11-24

5. On the minimum routing cost clustered tree problem;Journal of Combinatorial Optimization;2016-05-12

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP