A Linear Time Algorithm for Finding a k-Tree Core

Akiyoshi Shioura; Takeaki Uno

doi:10.1006/jagm.1996.0838

A Linear Time Algorithm for Finding a k-Tree Core

Akiyoshi Shioura, Takeaki Uno

INF - System Information Sciences

Research output: Contribution to journal › Article › peer-review

13 Citations (Scopus)

Abstract

Given a tree containing n vertices, consider the sum of the distance between all vertices and a k-leaf subtree (subtree which contains exactly k leaves). A k-tree core is a k-leaf subtree which minimizes the sum of the distances. In this paper, we propose a linear time algorithm for finding a k-tree core for a given k.

Original language	English
Pages (from-to)	281-290
Number of pages	10
Journal	Journal of Algorithms
Volume	23
Issue number	2
DOIs	https://doi.org/10.1006/jagm.1996.0838
Publication status	Published - 1997 May

ASJC Scopus subject areas

Control and Optimization
Computational Mathematics
Computational Theory and Mathematics

Access to Document

10.1006/jagm.1996.0838

Fingerprint Dive into the research topics of 'A Linear Time Algorithm for Finding a k-Tree Core'. Together they form a unique fingerprint.

Cite this

@article{bee21f7793584f4fbccbf8b33203a54b,

title = "A Linear Time Algorithm for Finding a k-Tree Core",

abstract = "Given a tree containing n vertices, consider the sum of the distance between all vertices and a k-leaf subtree (subtree which contains exactly k leaves). A k-tree core is a k-leaf subtree which minimizes the sum of the distances. In this paper, we propose a linear time algorithm for finding a k-tree core for a given k.",

author = "Akiyoshi Shioura and Takeaki Uno",

year = "1997",

month = may,

doi = "10.1006/jagm.1996.0838",

language = "English",

volume = "23",

pages = "281--290",

journal = "Journal of Algorithms",

issn = "0196-6774",

publisher = "Academic Press Inc.",

number = "2",

}

TY - JOUR

T1 - A Linear Time Algorithm for Finding a k-Tree Core

AU - Shioura, Akiyoshi

AU - Uno, Takeaki

PY - 1997/5

Y1 - 1997/5

N2 - Given a tree containing n vertices, consider the sum of the distance between all vertices and a k-leaf subtree (subtree which contains exactly k leaves). A k-tree core is a k-leaf subtree which minimizes the sum of the distances. In this paper, we propose a linear time algorithm for finding a k-tree core for a given k.

AB - Given a tree containing n vertices, consider the sum of the distance between all vertices and a k-leaf subtree (subtree which contains exactly k leaves). A k-tree core is a k-leaf subtree which minimizes the sum of the distances. In this paper, we propose a linear time algorithm for finding a k-tree core for a given k.

UR - http://www.scopus.com/inward/record.url?scp=0011308632&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0011308632&partnerID=8YFLogxK

U2 - 10.1006/jagm.1996.0838

DO - 10.1006/jagm.1996.0838

M3 - Article

AN - SCOPUS:0011308632

VL - 23

SP - 281

EP - 290

JO - Journal of Algorithms

JF - Journal of Algorithms

SN - 0196-6774

IS - 2

ER -

A Linear Time Algorithm for Finding a k-Tree Core

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Cite this