✦ LIBER ✦

Edge expression based on tree structure

✍ Scribed by Yijia Lin; Jiqing Dou; Eryi Zhang

Book ID: 103322657
Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 623 KB
Volume: 25
Category: Article
ISSN: 0031-3203
DOI: 10.1016/0031-3203(92)90049-o

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Second Attribute Algorithm Based on Tree

Second Attribute Algorithm Based on Tree Expression

✍ Su-Qing Han; Jue Wang 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 422 KB

On the Structure of Contractible Edges i

On the Structure of Contractible Edges ink-connected Partialk-trees

✍ N. S. Narayanaswamy; N. Sadagopan; L. Sunil Chandran 📂 Article 📅 2009 🏛 Springer Japan 🌐 English ⚖ 209 KB

PCBOST: Protein classification based on

PCBOST: Protein classification based on structural trees

✍ Alexey B. Gordeev; Anton M. Kargatov; Alexander V. Efimov 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 171 KB

Binocular Stereograph Based on Structure

Binocular Stereograph Based on Structures of Edge-Arcs

✍ Eiichi Tatsumi; Kunio Fukunaga; Tamotsu Kasai 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 719 KB

The edge-window-decoder representation f

The edge-window-decoder representation for tree-based problems

✍ Sang-Moon Soak; Corne, David.W.; Byung-Ha Ahn 📂 Article 📅 2006 🏛 IEEE 🌐 English ⚖ 1006 KB

On Minimum Edge Ranking Spanning Trees

✍ Kazuhisa Makino; Yushi Uno; Toshihide Ibaraki 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 243 KB

In this paper, we introduce the problem of computing a minimum edge ranking spanning tree (MERST); i.e., find a spanning tree of a given graph G whose edge ranking is minimum. Although the minimum edge ranking of a given tree can be computed in polynomial time, we show that problem MERST is NP-hard.