✦ LIBER ✦

On the fractional matching polytope of a hypergraph

✍ Scribed by Z. Füredi; J. Kahn; P. D. Seymour

Publisher: Springer-Verlag
Year: 1993
Tongue: English
Weight: 490 KB
Volume: 13
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf01303202

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on node packing polytopes on hype

A note on node packing polytopes on hypergraphs

✍ Yasuki Sekiguchi 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 524 KB

Optimizing over a slice of the bipartite

Optimizing over a slice of the bipartite matching polytope

✍ Matthias Leclerc 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 322 KB

The fractional matching numbers of graph

The fractional matching numbers of graphs

✍ Yan Liu; Guizhen Liu 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 85 KB

On certain classes of fractional matchin

On certain classes of fractional matchings

✍ J.R. Mühlbacher; F.X. Steinparz; G. Tinhofer 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 560 KB

Minimizing sums and products of linear f

Minimizing sums and products of linear fractional functions over a polytope

✍ Hiroshi Konno; Hajime Yamashita 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 108 KB 👁 1 views

In this paper, we develop efficient deterministic algorithms for globally minimizing the sum and the product of several linear fractional functions over a polytope. We will show that an elaborate implementation of an outer approximation algorithm applied to the master problem generated by a parametr

On the cyclomatic number of a hypergraph

✍ B.D. Acharya 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 572 KB

## This note generalizes the notion of cyclomatic number (or cycle rank) from Graph Theory to Hypergraph Theory and links it up with the concept of planarity in hypergraphs which was recently introducea by R.P. Jones. Sharp bounds are obtained for the cyclomatic number of the planar hypergraphs an