𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An algorithm for constructing edge-trees from hypergraphs

✍ Scribed by Fǎnicǎ Gavril; Robert Tamari

Publisher
John Wiley and Sons
Year
1983
Tongue
English
Weight
628 KB
Volume
13
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Algorithm for the Modular Decompositi
An Algorithm for the Modular Decomposition of Hypergraphs
✍ Paola Bonizzoni; Gianluca Della Vedova 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 147 KB

We propose an O n algorithm to build the modular decomposition tree of hypergraphs of dimension three and show how this algorithm can be generalized to time the decomposition of hypergraphs of any fixed dimension k.

An evolutionary algorithm for constructi
An evolutionary algorithm for constructing a decision forest: Combining the classification of disjoints decision trees
✍ Lior Rokach 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 232 KB

Decision forest is an ensemble classification method that combines multiple decision trees to in a manner that results in more accurate classifications. By combining multiple heterogeneous decision trees, decision forest is effective in mitigating noise that is often prevalent in real-world classifi