✦ LIBER ✦

Labeling Schemes for Tree Representation

✍ Scribed by Reuven Cohen; Pierre Fraigniaud; David Ilcinkas; Amos Korman; David Peleg

Publisher: Springer
Year: 2007
Tongue: English
Weight: 358 KB
Volume: 53
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-007-9089-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Labeling Schemes for Dynamic Tree Networ

Labeling Schemes for Dynamic Tree Networks

✍ Amos Korman; David Peleg; Yoav Rodeh 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 316 KB

General compact labeling schemes for dyn

General compact labeling schemes for dynamic trees

✍ Amos Korman 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 294 KB

A labeling scheme for young tableaux spa

A labeling scheme for young tableaux spanning representations of permutation groupS(N)

✍ Sarma, C. R.; Nampoothiri, A. V. V. 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 377 KB

A structure-dependent labeling scheme for the Standard Young Tableaux spanning the representations of the permutation group is outlined in the present work. This scheme is used to generate the representations of a select class of permutations such as dense cycles and general transpositions of the gr

Ray representation for k-trees

✍ Varol Akman; Wm.Randolph Franklin 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 457 KB

Compact separator decompositions in dyna

Compact separator decompositions in dynamic trees and applications to labeling schemes

✍ Amos Korman; David Peleg 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 426 KB

New polygonal approximation schemes for

New polygonal approximation schemes for object shape representation

✍ Jiann-Shing Wu; Jin-Jang Leou 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 885 KB