𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Edge-augmentation of hypergraphs

✍ Scribed by Eddie Cheng

Book ID
106276066
Publisher
Springer-Verlag
Year
1999
Tongue
English
Weight
175 KB
Volume
84
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Edge splitting and connectivity augmenta
Edge splitting and connectivity augmentation in directed hypergraphs
✍ Alex R. Berg; Bill Jackson; Tibor JordΓ‘n πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 262 KB

We prove theorems on edge splittings and edge-connectivity augmentation in directed hypergraphs, extending earlier results of Mader and Frank, respectively, on directed graphs.

Edge search in hypergraphs
Edge search in hypergraphs
✍ Ingo AlthΓΆfer; Matthias LΓΆwe πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 231 KB

Consider an undirected hypergraph H = (X, E) with a probability distribution P on the set E of its hyperedges. We investigate the average case complexity L(H, P) of finding an unknown hyperedge e\*e E, chosen according to P, if only tests are allowed that check, whether e\* is contained in the induc