𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Source location in undirected and directed hypergraphs

✍ Scribed by Attila Bernáth

Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
302 KB
Volume
36
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Locating Sources to Meet Flow Demands in
Locating Sources to Meet Flow Demands in Undirected Networks
✍ Kouji Arata; Satoru Iwata; Kazuhisa Makino; Satoru Fujishige 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 260 KB

This paper deals with the problem of finding a minimum-cost vertex subset S in an undirected network such that for each vertex v we can send d v units of flow from S to v. Although this problem is NP-hard in general, H.

Transversals of subtree hypergraphs and
Transversals of subtree hypergraphs and the source location problem in digraphs
✍ Jan van den Heuvel; Matthew Johnson 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 134 KB

## Abstract A hypergraph __H__ = (__V__,__E__) is a subtree hypergraph if there is a tree __T__ on __V__ such that each hyperedge of __E__ induces a subtree of __T__. Since the number of edges of a subtree hypergraph can be exponential in __n__ = |__V__|, one can not always expect to be able to fin

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.