✦ LIBER ✦

A Polynomial Time Algorithm for Unidimensional Unfolding Representations

✍ Scribed by J.P. Doignon; J.C. Falmagne

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 629 KB
Volume: 16
Category: Article
ISSN: 0196-6774
DOI: 10.1006/jagm.1994.1010

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A polynomial time circle packing algorit

A polynomial time circle packing algorithm

✍ Bojan Mohar 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 428 KB

Mohar, B., A polynomial time circle packing algorithm, Discrete Mathematics 117 (1993) 2577263. The Andreev-Koebe-Thurston circle packing theorem is generalized and improved in two ways. Simultaneous circle packing representations of the map and its dual map are obtained such that any two edges dua

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 approximation algorith

A polynomial time approximation algorithm for dynamic storage allocation

✍ H.A. Kierstead 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 520 KB

A polynomial time algorithm recognizing

A polynomial time algorithm recognizing link trees

✍ Peter Bugata; Attila Nagy; Roman Vávra 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 672 KB

The link of a vertex u of a graph G is the subgraph induced by all vertices adjacent to u . If all the links of G are isomorphic to a finite graph L, then G is called a realization of L, and L is called a link graph. At the Smolenice symposium of 1963, Zykov posed the problem of recognizing iink gr

A Polynomial Time Algorithm for Diophant

A Polynomial Time Algorithm for Diophantine Equations in One Variable

✍ F CUCKER; P KOIRAN; S SMALE 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 195 KB

We exhibit an algorithm computing, for a polynomial f ∈ Z [t], the set of its integer roots. The running time of the algorithm is polynomial in the size of the sparse encoding of f .

A Polynomial-Time Parsing Algorithm forK

A Polynomial-Time Parsing Algorithm forK-Depth Languages

✍ Alessandra Cherubini; Pierluigi San Pietro 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 736 KB

K-depth grammars extend context-free grammars allowing k 1 rewriting points for a single non-terminal at every step of a derivation. The family of languages generated by k-depth grammars is a proper extension of the family of context-free languages, while retaining many context-free properties, such