✦ LIBER ✦

The Algorithmic Aspects of Uncrowded Hypergraphs

✍ Scribed by Bertram-Kretzberg, Claudia; Lefmann, Hanno

Book ID: 118177524
Publisher: Society for Industrial and Applied Mathematics
Year: 1999
Tongue: English
Weight: 504 KB
Volume: 29
Category: Article
ISSN: 0097-5397
DOI: 10.1137/s0097539797323716

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algorithmic aspects of intersection grap

Algorithmic aspects of intersection graphs and representation hypergraphs

✍ Martin Charles Golumbic 📂 Article 📅 1988 🏛 Springer Japan 🌐 English ⚖ 893 KB

Algorithmic characterizations of interva

Algorithmic characterizations of interval ordered hypergraphs and applications

✍ A. Quilliot; Sun Xiao Chao 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 817 KB

Algorithmic aspects of multicanonical si

Algorithmic aspects of multicanonical simulations

✍ Bernd A. Berg 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 213 KB

Algorithmic aspects of partial convexity

✍ N. N. Metel’skii; V. G. Naidenko 📂 Article 📅 2000 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 816 KB

Algorithmic Aspects of Tree Amalgamation

✍ Sebastian Böcker; David Bryant; Andreas W.M. Dress; Mike A. Steel 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 129 KB

The amalgamation of leaf-labeled trees into a single (super)tree that "displays" each of the input trees is an important problem in classification. We discuss various approaches to this problem and show that a simple and well-known polynomialtime algorithm can be used to solve this problem whenever

Algorithmic Aspects of Neighborhood Numb

Algorithmic Aspects of Neighborhood Numbers

✍ Chang, Gerard J.; Farber, Martin; Tuza, Zsolt 📂 Article 📅 1993 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 858 KB