✦ LIBER ✦

An Algorithmic Involution for p(n)

✍ Scribed by J. Joichi; D. Stanton

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 211 KB
Volume: 15
Category: Article
ISSN: 0196-6774
DOI: 10.1006/jagm.1993.1039

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An involution for signed Eulerian number

An involution for signed Eulerian numbers

✍ Michelle L. Wachs 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 225 KB

An identity for matrix rings with involu

An identity for matrix rings with involution

✍ Charles Lanski 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 543 KB

An O(N) algorithm for polygonal approxim

An O(N) algorithm for polygonal approximation

✍ L.P Cordella; G Dettori 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 263 KB

An algorithm for two-dimensional simulat

An algorithm for two-dimensional simulation of reverse-biased beveled p−n junctions

✍ R. Kumar; S.G. Chamberlain; D.J. Roulston 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 234 KB

An O(n) time algorithm for maximum match

An O(n) time algorithm for maximum matching in P4-tidy graphs

✍ J.L. Fouquet; I. Parfenoff; H. Thuillier 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 630 KB

The A-tidy graphs were introduced by I. Rusu to generalize some already known classes of graphs with "few" induced P4 s. In this paper, we extend to PA-tidy graphs a linear time algorithm of C.-H. Yang and M.-S. Yu for finding a maximum matching in a cograph G (given a parse tree associated to G). @

An O(n log n) algorithm for finding diss

An O(n log n) algorithm for finding dissimilar strings

✍ Sarmad Abbasi; Anirvan Sengupta 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 411 KB

Let P be a finite alphabet and x E Z'. A string y E Zm is said to be k-dissimilar to x, if no k length substring of x is equal to any k length substring of y. We present an 0( n log n) algorithm which on input x E 2? and an integer m < n outputs an integer k and y E .Zm such that: (1) y is k-dissimi