✦ LIBER ✦

Efficient sets in partial k-trees

✍ Scribed by Jan Arne Telle; Andrzej Proskurowski

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 652 KB
Volume: 44
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(93)90226-e

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient algorithms and partial k-trees

📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 207 KB

Definability Equals Recognizability of P

Definability Equals Recognizability of Partial 3-Trees andsl k-Connected Partialsl k-Trees

✍ D. Kaller 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 274 KB

Asymptotic distributions for partial mat

Asymptotic distributions for partial match queries in K-d trees

✍ Ralph Neininger 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 229 KB

The distributional performance of the cost of a partial match query is investigated in some sorts of K-d trees. The trees under consideration are Bentley's K-d tree, the locally balanced K-d-t tree, and the random relaxed K-d tree. For each of these trees it is proved that in the uniform probabilist

Conserved ortholog sets in forest trees

✍ Konstantin V. Krutovsky; Christine G. Elsik; Marta Matvienko; Alex Kozik; David 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 259 KB

Intriguing sets in partial quadrangles

✍ John Bamberg; Frank De Clerck; Nicola Durante 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 316 KB

The point-line geometry known as a partial quadrangle (introduced by Cameron in 1975) has the property that for every point/line non-incident pair (P, ), there is at most one line through P concurrent with . So in particular, the well-studied objects known as generalized quadrangles are each partial

The number of maximal independent sets o

The number of maximal independent sets of (k+ 1)-valent trees

✍ Junho Song; Heewon Han; Changwoo Lee 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 191 KB