✦ LIBER ✦

The Polytope of Non-Crossing Graphs on a Planar Point Set

✍ Scribed by David Orden; Francisco Santos

Publisher: Springer
Year: 2004
Tongue: English
Weight: 355 KB
Volume: 33
Category: Article
ISSN: 0179-5376
DOI: 10.1007/s00454-004-1143-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On non-rank facets of the stable set pol

On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs

✍ Thomas M. Liebling; Gianpaolo Oriolo; Bianca Spille; Gautier Stauffer 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 297 KB

On the stable set polytope of a series-p

On the stable set polytope of a series-parallel graph

✍ A. R. Mahjoub 📂 Article 📅 1988 🏛 Springer-Verlag 🌐 English ⚖ 204 KB

On the facets of the stable set polytope

On the facets of the stable set polytope of quasi-line graphs

✍ Gautier Stauffer 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 237 KB

A successful concept for measuring non-p

A successful concept for measuring non-planarity of graphs: the crossing number

✍ László A. Székely 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 329 KB

A successful concept for measuring non-p

A successful concept for measuring non-planarity of graphs: the crossing number

✍ László A. Székely 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 300 KB

The santalo point of a planar convex set

✍ M.J. Kaiser 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 505 KB

An algorithm is described to determine the minimum area polar set of a planar convex polygon described in terms of its vertices. We adopt a result due to Santalo to verify our minimizing solution, and then demonstrate the search procedure on a few examples. 'For triangular (and centrally symmetric)