𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Decomposing Hypergraphs into Simple Hypertrees

✍ Scribed by Raphael Yuster

Book ID
106167883
Publisher
Springer-Verlag
Year
2000
Tongue
English
Weight
305 KB
Volume
20
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On decomposing a hypergraph into k conne
On decomposing a hypergraph into k connected sub-hypergraphs
✍ AndrΓ‘s Frank; TamΓ‘s KirΓ‘ly; Matthias Kriesell πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 159 KB

By applying the matroid partition theorem of J. Edmonds (J. Res. Nat. Bur. Standards Sect. B 69 (1965) 67) to a hypergraphic generalization of graphic matroids, due to Lorea (Cahiers Centre Etudes Rech. Oper. 17 (1975) 289), we obtain a generalization of Tutte's disjoint trees theorem for hypergraph

Decomposing Polynomial Systems into Simp
Decomposing Polynomial Systems into Simple Systems
✍ D. Wang πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 595 KB

A simple system is a pair of multivariate polynomial sets (one set for equations and the other for inequations) ordered in triangular form, in which every polynomial is squarefree and has non-vanishing leading coefficient with respect to its leading variable. This paper presents a method that decomp