Optimal chain partitions of trees

Jayadev Misra; R. Endre Tarjan

doi:10.1016/0020-0190(75)90057-5

Optimal chain partitions of trees

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

Original language	English (US)
Pages (from-to)	24-26
Number of pages	3
Journal	Information Processing Letters
Volume	4
Issue number	1
DOIs	https://doi.org/10.1016/0020-0190(75)90057-5
State	Published - Sep 1975
Externally published	Yes

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Signal Processing
Information Systems
Computer Science Applications

Keywords

Algorithm
chain
dynamic programming
priority queue
tree

Access to Document

10.1016/0020-0190(75)90057-5

Cite this

@article{2be2179e784c466e84cce0ba9a70d214,

title = "Optimal chain partitions of trees",

keywords = "Algorithm, chain, dynamic programming, priority queue, tree",

author = "Jayadev Misra and Tarjan, \{R. Endre\}",

year = "1975",

month = sep,

doi = "10.1016/0020-0190(75)90057-5",

language = "English (US)",

volume = "4",

pages = "24--26",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier B.V.",

number = "1",

}

TY - JOUR

T1 - Optimal chain partitions of trees

AU - Misra, Jayadev

AU - Tarjan, R. Endre

PY - 1975/9

Y1 - 1975/9

KW - Algorithm

KW - chain

KW - dynamic programming

KW - priority queue

KW - tree

UR - https://www.scopus.com/pages/publications/0347259053

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

U2 - 10.1016/0020-0190(75)90057-5

DO - 10.1016/0020-0190(75)90057-5

M3 - Article

AN - SCOPUS:0347259053

SN - 0020-0190

VL - 4

SP - 24

EP - 26

JO - Information Processing Letters

JF - Information Processing Letters

IS - 1

ER -

Optimal chain partitions of trees

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this