Skip to content

Opening book details…

About this Computer Science article

Optimal Algorithms for Finding Density-Constrained Longest and Heaviest Paths in a Tree by KIM, Sung Kwon is a Computer Science article available to read on EtoBox.

It is typically read by researchers, students, and practitioners in Computer Science.

Author
KIM, Sung Kwon
Publisher
Oxford University Press; Institute of Electronics, Information and Communications Engineers; Maruzen Co., Ltd/Maruzen Kabushikikaisha; Institute of Electronics, Information and Communications Engineers (IEICE) (ISSN 0916-8532)
Published
2010
Field
Computer Science (Physical Sciences)

More by KIM, Sung Kwon

Browse all works by KIM, Sung Kwon