✦ LIBER ✦

Tree enumeration modulo a consensus

✍ Scribed by Mariana Constantinescu; David Sankoff

Publisher: Springer
Year: 1986
Tongue: English
Weight: 454 KB
Volume: 3
Category: Article
ISSN: 0176-4268
DOI: 10.1007/bf01894196

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Enumeration of power sums modulo a prime

✍ Andrew M. Odlyzko; Richard P. Stanley 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 418 KB

A methodology for plane tree enumeration

✍ Elena Barcucci; Alberto Del Lungo; Elisa Pergola; Renzo Pinzani 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 717 KB

In this paper, we illustrate a method (called the ECO method) for enumerating some classes of combinatorial objects. By means of an operator, able to satisfy two particular conditions, we give some recursive descriptions of these subclasses. We use these descriptions to deduce the functional equatio

On enumerating the trees of a ladder net

On enumerating the trees of a ladder network

✍ D. E. Johnson; J. R. Johnson 📂 Article 📅 1973 🏛 John Wiley and Sons 🌐 English ⚖ 307 KB

An efficient tree architecture for modul

An efficient tree architecture for modulo 2 n +1 multiplication

✍ Wang, Zhongde ;Jullien, G. A. ;Miller, W. C. 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 709 KB

An Algorithm for Enumerating All Spannin

An Algorithm for Enumerating All Spanning Trees of a Directed Graph

✍ S. Kapoor; H. Ramesh 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 61 KB

A parallel algorithm for the enumeration

A parallel algorithm for the enumeration of the spanning trees of a graph

✍ Shao-Wen Mai; D.J. Evans 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 450 KB

As is well known, the strategy of divide-and-conquer is widely used in problem solving. The method of partitioning is also a fundamental strategy for the design of a parallel algorithm. The problem of enumerating the spanning trees of a graph arises in several contexts such as computer-aided design