𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A polynomial algorithm for the strong Helly property

✍ Scribed by Alain Bretto; Stéphane Ubéda; Janez Žerovnik

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
50 KB
Volume
81
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on hypergraphs with the Helly-pro
A note on hypergraphs with the Helly-property
✍ A. Gyárfás 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 189 KB

Receixed 10 October b)77 Revised 23 May lt-7S l.et bl bca t,,yperoraph and g a natural mmff-'cr. The sets <high can be wriiven as the .miot~ of t dilIere ~l edges of H fc, ml a ~ew hypergraph which is denoted by HL Let us suppose hint H has; 01e H( lly prope~ ty end we want to state something simila

The Helly-type property of non-trivial i
The Helly-type property of non-trivial intervals on a tree
✍ Maciej M. Sysklo 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 152 KB

The purpose of this note is non-trivial intervals on a tree. to prove a counterpart of the Helly property for a family of

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