A linear-time algorithm to compute a MAD tree of an interval graph-Reference-Cited by-同舟云学术

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

A linear-time algorithm to compute a MAD tree of an interval graph

Published:2004-03 Issue:5 Volume:89 Page:255-259
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Dahlhaus Elias,Dankelmann Peter,Ravi R.

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference7 articles.

1. A polynomial time approximation scheme for minimum routing cost spanning trees;Wu;SIAM J. Comput.,1999

2. Extremal values of distances in trees;Barefoot;Discrete Appl. Math.,1997

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

4. Computing the average distance of an interval graph;Dankelmann;Inform. Process. Lett.,1993

5. P. Dankelmann, P. Slater, Average distance in outerplanar graphs, Preprint

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

1. A survey of the all-pairs shortest paths problem and its variants in graphs;Acta Universitatis Sapientiae, Informatica;2016-06-01

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

3. A 2-approximation algorithm for the clustered minimum routing cost tree problem;FRONT ARTIF INTEL AP;2015

4. Clustered Trees with Minimum Inter-cluster Distance;2014 IEEE 17th International Conference on Computational Science and Engineering;2014-12

5. Spanning Trees: A Survey;Graphs and Combinatorics;2010-09-01

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP