✦ LIBER ✦

A polynomial algorithm for the membership problem with categorial grammars

✍ Scribed by Alain Finkel; Isabelle Tellier

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 1024 KB
Volume: 164
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(95)00211-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the membership problem for regular DN

On the membership problem for regular DNLC grammars

✍ IJ.J. Aalbersberg; G. Rozenberg; A. Ehrenfeucht 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 351 KB

A Polynomial-time Algorithm for the Bist

A Polynomial-time Algorithm for the Bistable Roommates Problem

✍ Jay Sethuraman; Chung-Piaw Teo 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 127 KB

In a recent paper, Weems introduced the bistable matching problem, and asked if a polynomial-time algorithm exists to decide the feasibility of the bistable roommates problem. We resolve this question in the affirmative using linear programming. In addition, we show that several (old and new) result

A polynomial-time algorithm for the chan

A polynomial-time algorithm for the change-making problem

✍ David Pearson 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 143 KB

A faster polynomial algorithm for the un

A faster polynomial algorithm for the unbalanced Hitchcock transportation problem

✍ Ulrich Brenner 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 320 KB

We present a new algorithm for the Hitchcock transportation problem. On instances with n sources and k sinks, our algorithm has a worst-case running time of O(nk 2 (log n + k log k)). It closes a gap between algorithms with running time linear in n but exponential in k and a polynomialtime algorithm

A polynomial algorithm for the extendabi

A polynomial algorithm for the extendability problem in bipartite graphs

✍ J. Lakhal; L. Litzler 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 587 KB

Let G = [ y E] be a simple connected graph and let k be an integer such that 0 < k < 1 VI /2. G is said to be k-extendable if it contains a perfect matching and every matching of k edges extends to, i.e. is a subset of, a perfect matching. The extendability problem consists in finding the maximum va

A strongly polynomial algorithm for the

A strongly polynomial algorithm for the inverse shortest arborescence problem

✍ Hu Zhiquan; Liu Zhenhong 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 909 KB

In this paper an inverse problem of the weighted shortest arborescence problem is discussed. That is. given a directed graph G and a set of nonnegative costs on its arcs. we need to modify those costs as little as possible to ensure that T, a given (.I-arborescence of G, is the shortest one. It is