✦ LIBER ✦

Linear algorithm for lexicographic enumeration of CFG parse trees

✍ Scribed by YunMei Dong

Book ID: 107359502
Publisher: Science in China Press (SCP)
Year: 2009
Tongue: English
Weight: 556 KB
Volume: 52
Category: Article
ISSN: 1674-733X
DOI: 10.1007/s11432-009-0132-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

A linear-time algorithm for the generati

A linear-time algorithm for the generation of trees

✍ L. Alonso; J. L. Rémy; R. Schott 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 908 KB

A linear algorithm for compact box-drawi

A linear algorithm for compact box-drawings of trees

✍ Masud Hasan; Md. Saidur Rahman; Takao Nishizeki 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 100 KB

A linear time algorithm for edge colorin

A linear time algorithm for edge coloring of binomial trees

✍ M. Kubale; K. Piwakowski 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 448 KB

We consider the problem of efficient coloring of the edges of a so-called binomial tree T, i.e. acyclic graph containing two kinds of edges: those which must have a single color and those which are to be colored with L consecutive colors, where L is an arbitrary integer greater than 1. We give an O(

A linear algorithm for a core of a tree

✍ Christine A Morgan; Peter J Slater 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 565 KB