✦ LIBER ✦

Packing cycles exactly in polynomial time

✍ Scribed by Qin Chen; Xujin Chen

Book ID: 106407392
Publisher: Springer US
Year: 2010
Tongue: English
Weight: 777 KB
Volume: 23
Category: Article
ISSN: 1382-6905
DOI: 10.1007/s10878-010-9347-1

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

Circle Packings of Maps in Polynomial Ti

Circle Packings of Maps in Polynomial Time

✍ Bojan Mohar 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 275 KB

The Andreev-Koebe-Thurston circle packing theorem is generalized and improved in two ways. First, we obtain simultaneous circle packings of the map and its dual map so that, in the corresponding straight-line representations of the map and the dual, any two edges dual to each other are perpendicular

Finding short cycles in embedded graph i

Finding short cycles in embedded graph in polynomial time

✍ Han Ren; Ni Cao 📂 Article 📅 2010 🏛 Higher Education Press and Springer 🌐 English ⚖ 139 KB

Packing Cycles in Graphs

✍ Guoli Ding; Wenan Zang 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 267 KB

Polynomial time approximation schemes fo

Polynomial time approximation schemes for class-constrained packing problems

✍ Hadas Shachnai; Tami Tamir 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 207 KB

We consider variants of the classic bin packing and multiple knapsack problems, in which sets of items of di erent classes (colours) need to be placed in bins; the items may have di erent sizes and values. Each bin has a limited capacity, and a bound on the number of distinct classes of items it can

Packing cycles in complete graphs

✍ Darryn Bryant; Daniel Horsley 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 242 KB